TSTP Solution File: SET018-3 by E-SAT---3.1
View Problem
- Process Solution
%------------------------------------------------------------------------------
% File : E-SAT---3.1
% Problem : SET018-3 : TPTP v8.1.2. Released v1.0.0.
% Transfm : none
% Format : tptp:raw
% Command : run_E %s %d THM
% Computer : n019.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 : 2400s
% WCLimit : 300s
% DateTime : Tue Oct 10 19:21:37 EDT 2023
% Result : Unsatisfiable 5.56s 1.27s
% Output : CNFRefutation 5.56s
% Verified :
% SZS Type : Refutation
% Derivation depth : 13
% Number of leaves : 13
% Syntax : Number of clauses : 47 ( 25 unt; 10 nHn; 37 RR)
% Number of literals : 89 ( 53 equ; 35 neg)
% Maximal clause size : 4 ( 1 avg)
% Maximal term depth : 3 ( 1 avg)
% Number of predicates : 4 ( 2 usr; 1 prp; 0-2 aty)
% Number of functors : 7 ( 7 usr; 4 con; 0-2 aty)
% Number of variables : 51 ( 14 sgn)
% Comments :
%------------------------------------------------------------------------------
cnf(ordered_pair,axiom,
ordered_pair(X1,X2) = non_ordered_pair(singleton_set(X1),non_ordered_pair(X1,X2)),
file('/export/starexec/sandbox2/tmp/tmp.mbsecQsYKa/E---3.1_32670.p',ordered_pair) ).
cnf(singleton_set,axiom,
singleton_set(X1) = non_ordered_pair(X1,X1),
file('/export/starexec/sandbox2/tmp/tmp.mbsecQsYKa/E---3.1_32670.p',singleton_set) ).
cnf(non_ordered_pair3,axiom,
( member(X1,non_ordered_pair(X2,X3))
| ~ little_set(X1)
| X1 != X3 ),
file('/export/starexec/sandbox2/tmp/tmp.mbsecQsYKa/E---3.1_32670.p',non_ordered_pair3) ).
cnf(equal_ordered_pair,hypothesis,
ordered_pair(a,b) = ordered_pair(c,d),
file('/export/starexec/sandbox2/tmp/tmp.mbsecQsYKa/E---3.1_32670.p',equal_ordered_pair) ).
cnf(non_ordered_pair4,axiom,
little_set(non_ordered_pair(X1,X2)),
file('/export/starexec/sandbox2/tmp/tmp.mbsecQsYKa/E---3.1_32670.p',non_ordered_pair4) ).
cnf(non_ordered_pair1,axiom,
( X1 = X2
| X1 = X3
| ~ member(X1,non_ordered_pair(X2,X3)) ),
file('/export/starexec/sandbox2/tmp/tmp.mbsecQsYKa/E---3.1_32670.p',non_ordered_pair1) ).
cnf(d_little_set,hypothesis,
little_set(d),
file('/export/starexec/sandbox2/tmp/tmp.mbsecQsYKa/E---3.1_32670.p',d_little_set) ).
cnf(prove_second_components_equal,negated_conjecture,
b != d,
file('/export/starexec/sandbox2/tmp/tmp.mbsecQsYKa/E---3.1_32670.p',prove_second_components_equal) ).
cnf(left_cancellation,axiom,
( X1 = X2
| ~ little_set(X1)
| ~ little_set(X2)
| non_ordered_pair(X3,X1) != non_ordered_pair(X3,X2) ),
file('/export/starexec/sandbox2/tmp/tmp.mbsecQsYKa/E---3.1_32670.p',left_cancellation) ).
cnf(c_little_set,hypothesis,
little_set(c),
file('/export/starexec/sandbox2/tmp/tmp.mbsecQsYKa/E---3.1_32670.p',c_little_set) ).
cnf(first_components_are_equal,axiom,
( X1 = X2
| ~ little_set(X1)
| ~ little_set(X2)
| ordered_pair(X1,X3) != ordered_pair(X2,X4) ),
file('/export/starexec/sandbox2/tmp/tmp.mbsecQsYKa/E---3.1_32670.p',first_components_are_equal) ).
cnf(a_little_set,hypothesis,
little_set(a),
file('/export/starexec/sandbox2/tmp/tmp.mbsecQsYKa/E---3.1_32670.p',a_little_set) ).
cnf(b_little_set,hypothesis,
little_set(b),
file('/export/starexec/sandbox2/tmp/tmp.mbsecQsYKa/E---3.1_32670.p',b_little_set) ).
cnf(c_0_13,axiom,
ordered_pair(X1,X2) = non_ordered_pair(singleton_set(X1),non_ordered_pair(X1,X2)),
ordered_pair ).
cnf(c_0_14,axiom,
singleton_set(X1) = non_ordered_pair(X1,X1),
singleton_set ).
cnf(c_0_15,axiom,
( member(X1,non_ordered_pair(X2,X3))
| ~ little_set(X1)
| X1 != X3 ),
non_ordered_pair3 ).
cnf(c_0_16,hypothesis,
ordered_pair(a,b) = ordered_pair(c,d),
equal_ordered_pair ).
cnf(c_0_17,plain,
ordered_pair(X1,X2) = non_ordered_pair(non_ordered_pair(X1,X1),non_ordered_pair(X1,X2)),
inference(rw,[status(thm)],[c_0_13,c_0_14]) ).
cnf(c_0_18,plain,
( member(X1,non_ordered_pair(X2,X1))
| ~ little_set(X1) ),
inference(er,[status(thm)],[c_0_15]) ).
cnf(c_0_19,hypothesis,
non_ordered_pair(non_ordered_pair(c,c),non_ordered_pair(c,d)) = non_ordered_pair(non_ordered_pair(a,a),non_ordered_pair(a,b)),
inference(rw,[status(thm)],[inference(rw,[status(thm)],[c_0_16,c_0_17]),c_0_17]) ).
cnf(c_0_20,axiom,
little_set(non_ordered_pair(X1,X2)),
non_ordered_pair4 ).
cnf(c_0_21,axiom,
( X1 = X2
| X1 = X3
| ~ member(X1,non_ordered_pair(X2,X3)) ),
non_ordered_pair1 ).
cnf(c_0_22,hypothesis,
member(non_ordered_pair(c,d),non_ordered_pair(non_ordered_pair(a,a),non_ordered_pair(a,b))),
inference(cn,[status(thm)],[inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_18,c_0_19]),c_0_20])]) ).
cnf(c_0_23,hypothesis,
( non_ordered_pair(c,d) = non_ordered_pair(a,a)
| non_ordered_pair(c,d) = non_ordered_pair(a,b) ),
inference(spm,[status(thm)],[c_0_21,c_0_22]) ).
cnf(c_0_24,hypothesis,
little_set(d),
d_little_set ).
cnf(c_0_25,hypothesis,
( non_ordered_pair(c,d) = non_ordered_pair(a,a)
| member(d,non_ordered_pair(a,b)) ),
inference(cn,[status(thm)],[inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_18,c_0_23]),c_0_24])]) ).
cnf(c_0_26,negated_conjecture,
b != d,
prove_second_components_equal ).
cnf(c_0_27,hypothesis,
( non_ordered_pair(c,d) = non_ordered_pair(a,a)
| d = a ),
inference(sr,[status(thm)],[inference(spm,[status(thm)],[c_0_21,c_0_25]),c_0_26]) ).
cnf(c_0_28,hypothesis,
( X1 = non_ordered_pair(c,c)
| X1 = non_ordered_pair(c,d)
| ~ member(X1,non_ordered_pair(non_ordered_pair(a,a),non_ordered_pair(a,b))) ),
inference(spm,[status(thm)],[c_0_21,c_0_19]) ).
cnf(c_0_29,hypothesis,
( d = a
| member(d,non_ordered_pair(a,a)) ),
inference(cn,[status(thm)],[inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_18,c_0_27]),c_0_24])]) ).
cnf(c_0_30,axiom,
( X1 = X2
| ~ little_set(X1)
| ~ little_set(X2)
| non_ordered_pair(X3,X1) != non_ordered_pair(X3,X2) ),
left_cancellation ).
cnf(c_0_31,hypothesis,
little_set(c),
c_little_set ).
cnf(c_0_32,hypothesis,
( non_ordered_pair(c,d) = non_ordered_pair(a,b)
| non_ordered_pair(a,b) = non_ordered_pair(c,c) ),
inference(cn,[status(thm)],[inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_28,c_0_18]),c_0_20])]) ).
cnf(c_0_33,hypothesis,
d = a,
inference(spm,[status(thm)],[c_0_21,c_0_29]) ).
cnf(c_0_34,axiom,
( X1 = X2
| ~ little_set(X1)
| ~ little_set(X2)
| ordered_pair(X1,X3) != ordered_pair(X2,X4) ),
first_components_are_equal ).
cnf(c_0_35,hypothesis,
little_set(a),
a_little_set ).
cnf(c_0_36,hypothesis,
( X1 = c
| non_ordered_pair(X2,X1) != non_ordered_pair(X2,c)
| ~ little_set(X1) ),
inference(spm,[status(thm)],[c_0_30,c_0_31]) ).
cnf(c_0_37,hypothesis,
( non_ordered_pair(a,b) = non_ordered_pair(c,c)
| non_ordered_pair(a,b) = non_ordered_pair(c,a) ),
inference(rw,[status(thm)],[c_0_32,c_0_33]) ).
cnf(c_0_38,hypothesis,
little_set(b),
b_little_set ).
cnf(c_0_39,plain,
( X1 = X2
| non_ordered_pair(non_ordered_pair(X1,X1),non_ordered_pair(X1,X3)) != non_ordered_pair(non_ordered_pair(X2,X2),non_ordered_pair(X2,X4))
| ~ little_set(X2)
| ~ little_set(X1) ),
inference(rw,[status(thm)],[inference(rw,[status(thm)],[c_0_34,c_0_17]),c_0_17]) ).
cnf(c_0_40,hypothesis,
( X1 = a
| non_ordered_pair(X2,X1) != non_ordered_pair(X2,a)
| ~ little_set(X1) ),
inference(spm,[status(thm)],[c_0_30,c_0_35]) ).
cnf(c_0_41,hypothesis,
( non_ordered_pair(a,b) = non_ordered_pair(c,a)
| b = c
| non_ordered_pair(c,c) != non_ordered_pair(a,c) ),
inference(cn,[status(thm)],[inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_36,c_0_37]),c_0_38])]) ).
cnf(c_0_42,negated_conjecture,
b != a,
inference(rw,[status(thm)],[c_0_26,c_0_33]) ).
cnf(c_0_43,hypothesis,
( X1 = c
| non_ordered_pair(non_ordered_pair(X1,X1),non_ordered_pair(X1,X2)) != non_ordered_pair(non_ordered_pair(a,a),non_ordered_pair(a,b))
| ~ little_set(X1) ),
inference(cn,[status(thm)],[inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_39,c_0_19]),c_0_31])]) ).
cnf(c_0_44,hypothesis,
( b = c
| non_ordered_pair(c,a) != non_ordered_pair(a,a)
| non_ordered_pair(c,c) != non_ordered_pair(a,c) ),
inference(sr,[status(thm)],[inference(cn,[status(thm)],[inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_40,c_0_41]),c_0_38])]),c_0_42]) ).
cnf(c_0_45,hypothesis,
c = a,
inference(cn,[status(thm)],[inference(rw,[status(thm)],[inference(er,[status(thm)],[c_0_43]),c_0_35])]) ).
cnf(c_0_46,hypothesis,
$false,
inference(sr,[status(thm)],[inference(cn,[status(thm)],[inference(rw,[status(thm)],[inference(rw,[status(thm)],[inference(rw,[status(thm)],[inference(rw,[status(thm)],[inference(rw,[status(thm)],[c_0_44,c_0_45]),c_0_45]),c_0_45]),c_0_45]),c_0_45])]),c_0_42]),
[proof] ).
%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.03/0.12 % Problem : SET018-3 : TPTP v8.1.2. Released v1.0.0.
% 0.03/0.13 % Command : run_E %s %d THM
% 0.14/0.35 % Computer : n019.cluster.edu
% 0.14/0.35 % Model : x86_64 x86_64
% 0.14/0.35 % CPU : Intel(R) Xeon(R) CPU E5-2620 v4 @ 2.10GHz
% 0.14/0.35 % Memory : 8042.1875MB
% 0.14/0.35 % OS : Linux 3.10.0-693.el7.x86_64
% 0.14/0.35 % CPULimit : 2400
% 0.14/0.35 % WCLimit : 300
% 0.14/0.35 % DateTime : Mon Oct 2 17:11:51 EDT 2023
% 0.14/0.35 % CPUTime :
% 0.21/0.49 Running first-order model finding
% 0.21/0.49 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/tmp/tmp.mbsecQsYKa/E---3.1_32670.p
% 5.56/1.27 # Version: 3.1pre001
% 5.56/1.27 # Preprocessing class: FSLSSMSMSSSNFFN.
% 5.56/1.27 # Scheduled 4 strats onto 8 cores with 300 seconds (2400 total)
% 5.56/1.27 # Starting C07_19_nc_SOS_SAT001_MinMin_p005000_rr with 1500s (5) cores
% 5.56/1.27 # Starting new_bool_3 with 300s (1) cores
% 5.56/1.27 # Starting new_bool_1 with 300s (1) cores
% 5.56/1.27 # Starting sh5l with 300s (1) cores
% 5.56/1.27 # C07_19_nc_SOS_SAT001_MinMin_p005000_rr with pid 32747 completed with status 0
% 5.56/1.27 # Result found by C07_19_nc_SOS_SAT001_MinMin_p005000_rr
% 5.56/1.27 # Preprocessing class: FSLSSMSMSSSNFFN.
% 5.56/1.27 # Scheduled 4 strats onto 8 cores with 300 seconds (2400 total)
% 5.56/1.27 # Starting C07_19_nc_SOS_SAT001_MinMin_p005000_rr with 1500s (5) cores
% 5.56/1.27 # No SInE strategy applied
% 5.56/1.27 # Search class: FGHSF-FFLM31-MFFFFFNN
% 5.56/1.27 # partial match(1): FGHSM-FFLM31-MFFFFFNN
% 5.56/1.27 # Scheduled 8 strats onto 5 cores with 1500 seconds (1500 total)
% 5.56/1.27 # Starting 208_C09_12_F1_SE_CS_SP_PS_S070I with 541s (1) cores
% 5.56/1.27 # Starting C07_19_nc_SOS_SAT001_MinMin_p005000_rr with 151s (1) cores
% 5.56/1.27 # Starting G-E--_208_B07_F1_AE_CS_SP_PS_S0Y with 136s (1) cores
% 5.56/1.27 # Starting G-E--_200_B07_F1_AE_CS_SP_PI_S0Y with 136s (1) cores
% 5.56/1.27 # Starting U----_213g_00_B10_00_F1_SE_PI_CS_SP_PS_S5PRR_RG_S04AN with 136s (1) cores
% 5.56/1.27 # C07_19_nc_SOS_SAT001_MinMin_p005000_rr with pid 32755 completed with status 0
% 5.56/1.27 # Result found by C07_19_nc_SOS_SAT001_MinMin_p005000_rr
% 5.56/1.27 # Preprocessing class: FSLSSMSMSSSNFFN.
% 5.56/1.27 # Scheduled 4 strats onto 8 cores with 300 seconds (2400 total)
% 5.56/1.27 # Starting C07_19_nc_SOS_SAT001_MinMin_p005000_rr with 1500s (5) cores
% 5.56/1.27 # No SInE strategy applied
% 5.56/1.27 # Search class: FGHSF-FFLM31-MFFFFFNN
% 5.56/1.27 # partial match(1): FGHSM-FFLM31-MFFFFFNN
% 5.56/1.27 # Scheduled 8 strats onto 5 cores with 1500 seconds (1500 total)
% 5.56/1.27 # Starting 208_C09_12_F1_SE_CS_SP_PS_S070I with 541s (1) cores
% 5.56/1.27 # Starting C07_19_nc_SOS_SAT001_MinMin_p005000_rr with 151s (1) cores
% 5.56/1.27 # Preprocessing time : 0.002 s
% 5.56/1.27 # Presaturation interreduction done
% 5.56/1.27
% 5.56/1.27 # Proof found!
% 5.56/1.27 # SZS status Unsatisfiable
% 5.56/1.27 # SZS output start CNFRefutation
% See solution above
% 5.56/1.27 # Parsed axioms : 149
% 5.56/1.27 # Removed by relevancy pruning/SinE : 0
% 5.56/1.27 # Initial clauses : 149
% 5.56/1.27 # Removed in clause preprocessing : 6
% 5.56/1.27 # Initial clauses in saturation : 143
% 5.56/1.27 # Processed clauses : 4352
% 5.56/1.27 # ...of these trivial : 7
% 5.56/1.27 # ...subsumed : 2772
% 5.56/1.27 # ...remaining for further processing : 1573
% 5.56/1.27 # Other redundant clauses eliminated : 50
% 5.56/1.27 # Clauses deleted for lack of memory : 0
% 5.56/1.27 # Backward-subsumed : 45
% 5.56/1.27 # Backward-rewritten : 220
% 5.56/1.27 # Generated clauses : 56726
% 5.56/1.27 # ...of the previous two non-redundant : 55205
% 5.56/1.27 # ...aggressively subsumed : 0
% 5.56/1.27 # Contextual simplify-reflections : 56
% 5.56/1.27 # Paramodulations : 56618
% 5.56/1.27 # Factorizations : 24
% 5.56/1.27 # NegExts : 0
% 5.56/1.27 # Equation resolutions : 84
% 5.56/1.27 # Total rewrite steps : 6497
% 5.56/1.27 # Propositional unsat checks : 0
% 5.56/1.27 # Propositional check models : 0
% 5.56/1.27 # Propositional check unsatisfiable : 0
% 5.56/1.27 # Propositional clauses : 0
% 5.56/1.27 # Propositional clauses after purity: 0
% 5.56/1.27 # Propositional unsat core size : 0
% 5.56/1.27 # Propositional preprocessing time : 0.000
% 5.56/1.27 # Propositional encoding time : 0.000
% 5.56/1.27 # Propositional solver time : 0.000
% 5.56/1.27 # Success case prop preproc time : 0.000
% 5.56/1.27 # Success case prop encoding time : 0.000
% 5.56/1.27 # Success case prop solver time : 0.000
% 5.56/1.27 # Current number of processed clauses : 1151
% 5.56/1.27 # Positive orientable unit clauses : 63
% 5.56/1.27 # Positive unorientable unit clauses: 0
% 5.56/1.27 # Negative unit clauses : 9
% 5.56/1.27 # Non-unit-clauses : 1079
% 5.56/1.27 # Current number of unprocessed clauses: 50922
% 5.56/1.27 # ...number of literals in the above : 142275
% 5.56/1.27 # Current number of archived formulas : 0
% 5.56/1.27 # Current number of archived clauses : 414
% 5.56/1.27 # Clause-clause subsumption calls (NU) : 155634
% 5.56/1.27 # Rec. Clause-clause subsumption calls : 96231
% 5.56/1.27 # Non-unit clause-clause subsumptions : 1306
% 5.56/1.27 # Unit Clause-clause subsumption calls : 5585
% 5.56/1.27 # Rewrite failures with RHS unbound : 0
% 5.56/1.27 # BW rewrite match attempts : 43
% 5.56/1.27 # BW rewrite match successes : 28
% 5.56/1.27 # Condensation attempts : 0
% 5.56/1.27 # Condensation successes : 0
% 5.56/1.27 # Termbank termtop insertions : 683749
% 5.56/1.27
% 5.56/1.27 # -------------------------------------------------
% 5.56/1.27 # User time : 0.572 s
% 5.56/1.27 # System time : 0.032 s
% 5.56/1.27 # Total time : 0.604 s
% 5.56/1.27 # Maximum resident set size: 2096 pages
% 5.56/1.27
% 5.56/1.27 # -------------------------------------------------
% 5.56/1.27 # User time : 3.155 s
% 5.56/1.27 # System time : 0.120 s
% 5.56/1.27 # Total time : 3.275 s
% 5.56/1.27 # Maximum resident set size: 1804 pages
% 5.56/1.27 % E---3.1 exiting
%------------------------------------------------------------------------------