TSTP Solution File: SET017-6 by E-SAT---3.1.00
View Problem
- Process Solution
%------------------------------------------------------------------------------
% File : E-SAT---3.1.00
% Problem : SET017-6 : TPTP v8.2.0. Bugfixed v2.1.0.
% Transfm : none
% Format : tptp:raw
% Command : run_E %s %d THM
% Computer : n018.cluster.edu
% Model : x86_64 x86_64
% CPU : Intel(R) Xeon(R) CPU E5-2620 v4 2.10GHz
% Memory : 8042.1875MB
% OS : Linux 3.10.0-693.el7.x86_64
% CPULimit : 300s
% WCLimit : 300s
% DateTime : Tue May 21 02:56:56 EDT 2024
% Result : Unsatisfiable 0.16s 0.47s
% Output : CNFRefutation 0.16s
% Verified :
% SZS Type : Refutation
% Derivation depth : 8
% Number of leaves : 7
% Syntax : Number of clauses : 27 ( 12 unt; 3 nHn; 24 RR)
% Number of literals : 45 ( 15 equ; 18 neg)
% Maximal clause size : 3 ( 1 avg)
% Maximal term depth : 2 ( 1 avg)
% Number of predicates : 3 ( 1 usr; 1 prp; 0-2 aty)
% Number of functors : 7 ( 7 usr; 4 con; 0-2 aty)
% Number of variables : 40 ( 15 sgn)
% Comments :
%------------------------------------------------------------------------------
cnf(unordered_pair3,axiom,
( member(X1,unordered_pair(X2,X1))
| ~ member(X1,universal_class) ),
file('/export/starexec/sandbox2/benchmark/Axioms/SET004-0.ax',unordered_pair3) ).
cnf(unordered_pair_member,axiom,
( X1 = X2
| X1 = X3
| ~ member(X1,unordered_pair(X2,X3)) ),
file('/export/starexec/sandbox2/benchmark/Axioms/SET004-0.ax',unordered_pair_member) ).
cnf(prove_left_cancellation_1,negated_conjecture,
unordered_pair(x,y) = unordered_pair(x,z),
file('/export/starexec/sandbox2/benchmark/theBenchmark.p',prove_left_cancellation_1) ).
cnf(prove_left_cancellation_3,negated_conjecture,
y != z,
file('/export/starexec/sandbox2/benchmark/theBenchmark.p',prove_left_cancellation_3) ).
cnf(cartesian_product1,axiom,
( member(X1,X3)
| ~ member(ordered_pair(X1,X2),cross_product(X3,X4)) ),
file('/export/starexec/sandbox2/benchmark/Axioms/SET004-0.ax',cartesian_product1) ).
cnf(prove_left_cancellation_2,negated_conjecture,
member(ordered_pair(y,z),cross_product(universal_class,universal_class)),
file('/export/starexec/sandbox2/benchmark/theBenchmark.p',prove_left_cancellation_2) ).
cnf(cartesian_product2,axiom,
( member(X2,X4)
| ~ member(ordered_pair(X1,X2),cross_product(X3,X4)) ),
file('/export/starexec/sandbox2/benchmark/Axioms/SET004-0.ax',cartesian_product2) ).
cnf(c_0_7,plain,
( member(X1,unordered_pair(X2,X1))
| ~ member(X1,universal_class) ),
inference(fof_simplification,[status(thm)],[unordered_pair3]) ).
cnf(c_0_8,plain,
( X1 = X2
| X1 = X3
| ~ member(X1,unordered_pair(X2,X3)) ),
inference(fof_simplification,[status(thm)],[unordered_pair_member]) ).
cnf(c_0_9,plain,
( member(X1,unordered_pair(X2,X1))
| ~ member(X1,universal_class) ),
c_0_7 ).
cnf(c_0_10,negated_conjecture,
unordered_pair(x,y) = unordered_pair(x,z),
prove_left_cancellation_1 ).
cnf(c_0_11,negated_conjecture,
y != z,
inference(fof_simplification,[status(thm)],[prove_left_cancellation_3]) ).
cnf(c_0_12,plain,
( member(X1,X3)
| ~ member(ordered_pair(X1,X2),cross_product(X3,X4)) ),
inference(fof_simplification,[status(thm)],[cartesian_product1]) ).
cnf(c_0_13,plain,
( X1 = X2
| X1 = X3
| ~ member(X1,unordered_pair(X2,X3)) ),
c_0_8 ).
cnf(c_0_14,negated_conjecture,
( member(y,unordered_pair(x,z))
| ~ member(y,universal_class) ),
inference(spm,[status(thm)],[c_0_9,c_0_10]) ).
cnf(c_0_15,negated_conjecture,
y != z,
c_0_11 ).
cnf(c_0_16,plain,
( member(X1,X3)
| ~ member(ordered_pair(X1,X2),cross_product(X3,X4)) ),
c_0_12 ).
cnf(c_0_17,negated_conjecture,
member(ordered_pair(y,z),cross_product(universal_class,universal_class)),
prove_left_cancellation_2 ).
cnf(c_0_18,negated_conjecture,
( x = y
| ~ member(y,universal_class) ),
inference(sr,[status(thm)],[inference(spm,[status(thm)],[c_0_13,c_0_14]),c_0_15]) ).
cnf(c_0_19,negated_conjecture,
member(y,universal_class),
inference(spm,[status(thm)],[c_0_16,c_0_17]) ).
cnf(c_0_20,negated_conjecture,
x = y,
inference(cn,[status(thm)],[inference(rw,[status(thm)],[c_0_18,c_0_19])]) ).
cnf(c_0_21,plain,
( member(X2,X4)
| ~ member(ordered_pair(X1,X2),cross_product(X3,X4)) ),
inference(fof_simplification,[status(thm)],[cartesian_product2]) ).
cnf(c_0_22,negated_conjecture,
unordered_pair(y,y) = unordered_pair(y,z),
inference(rw,[status(thm)],[inference(rw,[status(thm)],[c_0_10,c_0_20]),c_0_20]) ).
cnf(c_0_23,plain,
( member(X2,X4)
| ~ member(ordered_pair(X1,X2),cross_product(X3,X4)) ),
c_0_21 ).
cnf(c_0_24,negated_conjecture,
( X1 = y
| ~ member(X1,unordered_pair(y,z)) ),
inference(spm,[status(thm)],[c_0_13,c_0_22]) ).
cnf(c_0_25,negated_conjecture,
member(z,universal_class),
inference(spm,[status(thm)],[c_0_23,c_0_17]) ).
cnf(c_0_26,negated_conjecture,
$false,
inference(sr,[status(thm)],[inference(cn,[status(thm)],[inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_24,c_0_9]),c_0_25])]),c_0_15]),
[proof] ).
%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.02/0.10 % Problem : SET017-6 : TPTP v8.2.0. Bugfixed v2.1.0.
% 0.02/0.11 % Command : run_E %s %d THM
% 0.11/0.31 % Computer : n018.cluster.edu
% 0.11/0.31 % Model : x86_64 x86_64
% 0.11/0.31 % CPU : Intel(R) Xeon(R) CPU E5-2620 v4 @ 2.10GHz
% 0.11/0.31 % Memory : 8042.1875MB
% 0.11/0.31 % OS : Linux 3.10.0-693.el7.x86_64
% 0.11/0.31 % CPULimit : 300
% 0.11/0.31 % WCLimit : 300
% 0.11/0.31 % DateTime : Mon May 20 13:25:38 EDT 2024
% 0.11/0.31 % CPUTime :
% 0.16/0.44 Running first-order model finding
% 0.16/0.44 Running: /export/starexec/sandbox2/solver/bin/eprover --delete-bad-limit=2000000000 --definitional-cnf=24 -s --print-statistics -R --print-version --proof-object --satauto-schedule=8 --cpu-limit=300 /export/starexec/sandbox2/benchmark/theBenchmark.p
% 0.16/0.47 # Version: 3.1.0
% 0.16/0.47 # Preprocessing class: FSLSSMSMSSSNFFN.
% 0.16/0.47 # Scheduled 4 strats onto 8 cores with 300 seconds (2400 total)
% 0.16/0.47 # Starting C07_19_nc_SOS_SAT001_MinMin_p005000_rr with 1500s (5) cores
% 0.16/0.47 # Starting new_bool_3 with 300s (1) cores
% 0.16/0.47 # Starting new_bool_1 with 300s (1) cores
% 0.16/0.47 # Starting sh5l with 300s (1) cores
% 0.16/0.47 # new_bool_3 with pid 21138 completed with status 0
% 0.16/0.47 # Result found by new_bool_3
% 0.16/0.47 # Preprocessing class: FSLSSMSMSSSNFFN.
% 0.16/0.47 # Scheduled 4 strats onto 8 cores with 300 seconds (2400 total)
% 0.16/0.47 # Starting C07_19_nc_SOS_SAT001_MinMin_p005000_rr with 1500s (5) cores
% 0.16/0.47 # Starting new_bool_3 with 300s (1) cores
% 0.16/0.47 # SinE strategy is GSinE(CountFormulas,hypos,1.5,,3,20000,1.0)
% 0.16/0.47 # Search class: FGHSM-FFMF31-MFFFFFNN
% 0.16/0.47 # Scheduled 5 strats onto 1 cores with 300 seconds (300 total)
% 0.16/0.47 # Starting G-E--_208_C18_F1_SE_CS_SP_PS_S5PRR_RG_S04BN with 181s (1) cores
% 0.16/0.47 # G-E--_208_C18_F1_SE_CS_SP_PS_S5PRR_RG_S04BN with pid 21141 completed with status 0
% 0.16/0.47 # Result found by G-E--_208_C18_F1_SE_CS_SP_PS_S5PRR_RG_S04BN
% 0.16/0.47 # Preprocessing class: FSLSSMSMSSSNFFN.
% 0.16/0.47 # Scheduled 4 strats onto 8 cores with 300 seconds (2400 total)
% 0.16/0.47 # Starting C07_19_nc_SOS_SAT001_MinMin_p005000_rr with 1500s (5) cores
% 0.16/0.47 # Starting new_bool_3 with 300s (1) cores
% 0.16/0.47 # SinE strategy is GSinE(CountFormulas,hypos,1.5,,3,20000,1.0)
% 0.16/0.47 # Search class: FGHSM-FFMF31-MFFFFFNN
% 0.16/0.47 # Scheduled 5 strats onto 1 cores with 300 seconds (300 total)
% 0.16/0.47 # Starting G-E--_208_C18_F1_SE_CS_SP_PS_S5PRR_RG_S04BN with 181s (1) cores
% 0.16/0.47 # Preprocessing time : 0.004 s
% 0.16/0.47 # Presaturation interreduction done
% 0.16/0.47
% 0.16/0.47 # Proof found!
% 0.16/0.47 # SZS status Unsatisfiable
% 0.16/0.47 # SZS output start CNFRefutation
% See solution above
% 0.16/0.47 # Parsed axioms : 94
% 0.16/0.47 # Removed by relevancy pruning/SinE : 66
% 0.16/0.47 # Initial clauses : 28
% 0.16/0.47 # Removed in clause preprocessing : 0
% 0.16/0.47 # Initial clauses in saturation : 28
% 0.16/0.47 # Processed clauses : 52
% 0.16/0.47 # ...of these trivial : 0
% 0.16/0.47 # ...subsumed : 0
% 0.16/0.47 # ...remaining for further processing : 52
% 0.16/0.47 # Other redundant clauses eliminated : 4
% 0.16/0.47 # Clauses deleted for lack of memory : 0
% 0.16/0.47 # Backward-subsumed : 0
% 0.16/0.47 # Backward-rewritten : 3
% 0.16/0.47 # Generated clauses : 24
% 0.16/0.47 # ...of the previous two non-redundant : 17
% 0.16/0.47 # ...aggressively subsumed : 0
% 0.16/0.47 # Contextual simplify-reflections : 0
% 0.16/0.47 # Paramodulations : 12
% 0.16/0.47 # Factorizations : 8
% 0.16/0.47 # NegExts : 0
% 0.16/0.47 # Equation resolutions : 4
% 0.16/0.47 # Disequality decompositions : 0
% 0.16/0.47 # Total rewrite steps : 10
% 0.16/0.47 # ...of those cached : 4
% 0.16/0.47 # Propositional unsat checks : 0
% 0.16/0.47 # Propositional check models : 0
% 0.16/0.47 # Propositional check unsatisfiable : 0
% 0.16/0.47 # Propositional clauses : 0
% 0.16/0.47 # Propositional clauses after purity: 0
% 0.16/0.47 # Propositional unsat core size : 0
% 0.16/0.47 # Propositional preprocessing time : 0.000
% 0.16/0.47 # Propositional encoding time : 0.000
% 0.16/0.47 # Propositional solver time : 0.000
% 0.16/0.47 # Success case prop preproc time : 0.000
% 0.16/0.47 # Success case prop encoding time : 0.000
% 0.16/0.47 # Success case prop solver time : 0.000
% 0.16/0.47 # Current number of processed clauses : 20
% 0.16/0.47 # Positive orientable unit clauses : 11
% 0.16/0.47 # Positive unorientable unit clauses: 0
% 0.16/0.47 # Negative unit clauses : 1
% 0.16/0.47 # Non-unit-clauses : 8
% 0.16/0.47 # Current number of unprocessed clauses: 20
% 0.16/0.47 # ...number of literals in the above : 42
% 0.16/0.47 # Current number of archived formulas : 0
% 0.16/0.47 # Current number of archived clauses : 30
% 0.16/0.47 # Clause-clause subsumption calls (NU) : 28
% 0.16/0.47 # Rec. Clause-clause subsumption calls : 27
% 0.16/0.47 # Non-unit clause-clause subsumptions : 0
% 0.16/0.47 # Unit Clause-clause subsumption calls : 0
% 0.16/0.47 # Rewrite failures with RHS unbound : 0
% 0.16/0.47 # BW rewrite match attempts : 7
% 0.16/0.47 # BW rewrite match successes : 3
% 0.16/0.47 # Condensation attempts : 0
% 0.16/0.47 # Condensation successes : 0
% 0.16/0.47 # Termbank termtop insertions : 1549
% 0.16/0.47 # Search garbage collected termcells : 351
% 0.16/0.47
% 0.16/0.47 # -------------------------------------------------
% 0.16/0.47 # User time : 0.006 s
% 0.16/0.47 # System time : 0.004 s
% 0.16/0.47 # Total time : 0.009 s
% 0.16/0.47 # Maximum resident set size: 1868 pages
% 0.16/0.47
% 0.16/0.47 # -------------------------------------------------
% 0.16/0.47 # User time : 0.008 s
% 0.16/0.47 # System time : 0.007 s
% 0.16/0.47 # Total time : 0.015 s
% 0.16/0.47 # Maximum resident set size: 1780 pages
% 0.16/0.47 % E---3.1 exiting
%------------------------------------------------------------------------------