TSTP Solution File: SET018-6 by E-SAT---3.1
View Problem
- Process Solution
%------------------------------------------------------------------------------
% File : E-SAT---3.1
% Problem : SET018-6 : TPTP v8.1.2. Bugfixed v2.1.0.
% Transfm : none
% Format : tptp:raw
% Command : run_E %s %d THM
% Computer : n014.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:38 EDT 2023
% Result : Unsatisfiable 0.16s 0.50s
% Output : CNFRefutation 0.16s
% Verified :
% SZS Type : Refutation
% Derivation depth : 21
% Number of leaves : 9
% Syntax : Number of clauses : 45 ( 27 unt; 12 nHn; 34 RR)
% Number of literals : 71 ( 40 equ; 14 neg)
% Maximal clause size : 3 ( 1 avg)
% Maximal term depth : 4 ( 1 avg)
% Number of predicates : 3 ( 1 usr; 1 prp; 0-2 aty)
% Number of functors : 8 ( 8 usr; 5 con; 0-2 aty)
% Number of variables : 28 ( 8 sgn)
% Comments :
%------------------------------------------------------------------------------
cnf(ordered_pair,axiom,
unordered_pair(singleton(X1),unordered_pair(X1,singleton(X2))) = ordered_pair(X1,X2),
file('/export/starexec/sandbox2/tmp/tmp.AhVgnNmidb/E---3.1_428.p',ordered_pair) ).
cnf(singleton_set,axiom,
unordered_pair(X1,X1) = singleton(X1),
file('/export/starexec/sandbox2/tmp/tmp.AhVgnNmidb/E---3.1_428.p',singleton_set) ).
cnf(prove_ordered_pair_determines_components2_1,negated_conjecture,
ordered_pair(w,x) = ordered_pair(y,z),
file('/export/starexec/sandbox2/tmp/tmp.AhVgnNmidb/E---3.1_428.p',prove_ordered_pair_determines_components2_1) ).
cnf(unordered_pair3,axiom,
( member(X1,unordered_pair(X2,X1))
| ~ member(X1,universal_class) ),
file('/export/starexec/sandbox2/tmp/tmp.AhVgnNmidb/E---3.1_428.p',unordered_pair3) ).
cnf(unordered_pairs_in_universal,axiom,
member(unordered_pair(X1,X2),universal_class),
file('/export/starexec/sandbox2/tmp/tmp.AhVgnNmidb/E---3.1_428.p',unordered_pairs_in_universal) ).
cnf(unordered_pair_member,axiom,
( X1 = X2
| X1 = X3
| ~ member(X1,unordered_pair(X2,X3)) ),
file('/export/starexec/sandbox2/tmp/tmp.AhVgnNmidb/E---3.1_428.p',unordered_pair_member) ).
cnf(unordered_pair2,axiom,
( member(X1,unordered_pair(X1,X2))
| ~ member(X1,universal_class) ),
file('/export/starexec/sandbox2/tmp/tmp.AhVgnNmidb/E---3.1_428.p',unordered_pair2) ).
cnf(prove_ordered_pair_determines_components2_2,negated_conjecture,
member(x,universal_class),
file('/export/starexec/sandbox2/tmp/tmp.AhVgnNmidb/E---3.1_428.p',prove_ordered_pair_determines_components2_2) ).
cnf(prove_ordered_pair_determines_components2_3,negated_conjecture,
x != z,
file('/export/starexec/sandbox2/tmp/tmp.AhVgnNmidb/E---3.1_428.p',prove_ordered_pair_determines_components2_3) ).
cnf(c_0_9,axiom,
unordered_pair(singleton(X1),unordered_pair(X1,singleton(X2))) = ordered_pair(X1,X2),
ordered_pair ).
cnf(c_0_10,axiom,
unordered_pair(X1,X1) = singleton(X1),
singleton_set ).
cnf(c_0_11,negated_conjecture,
ordered_pair(w,x) = ordered_pair(y,z),
prove_ordered_pair_determines_components2_1 ).
cnf(c_0_12,plain,
unordered_pair(unordered_pair(X1,X1),unordered_pair(X1,unordered_pair(X2,X2))) = ordered_pair(X1,X2),
inference(rw,[status(thm)],[inference(rw,[status(thm)],[c_0_9,c_0_10]),c_0_10]) ).
cnf(c_0_13,axiom,
( member(X1,unordered_pair(X2,X1))
| ~ member(X1,universal_class) ),
unordered_pair3 ).
cnf(c_0_14,negated_conjecture,
unordered_pair(unordered_pair(y,y),unordered_pair(y,unordered_pair(z,z))) = unordered_pair(unordered_pair(w,w),unordered_pair(w,unordered_pair(x,x))),
inference(rw,[status(thm)],[inference(rw,[status(thm)],[c_0_11,c_0_12]),c_0_12]) ).
cnf(c_0_15,axiom,
member(unordered_pair(X1,X2),universal_class),
unordered_pairs_in_universal ).
cnf(c_0_16,axiom,
( X1 = X2
| X1 = X3
| ~ member(X1,unordered_pair(X2,X3)) ),
unordered_pair_member ).
cnf(c_0_17,negated_conjecture,
member(unordered_pair(y,unordered_pair(z,z)),unordered_pair(unordered_pair(w,w),unordered_pair(w,unordered_pair(x,x)))),
inference(cn,[status(thm)],[inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_13,c_0_14]),c_0_15])]) ).
cnf(c_0_18,negated_conjecture,
( unordered_pair(y,unordered_pair(z,z)) = unordered_pair(w,unordered_pair(x,x))
| unordered_pair(y,unordered_pair(z,z)) = unordered_pair(w,w) ),
inference(spm,[status(thm)],[c_0_16,c_0_17]) ).
cnf(c_0_19,axiom,
( member(X1,unordered_pair(X1,X2))
| ~ member(X1,universal_class) ),
unordered_pair2 ).
cnf(c_0_20,negated_conjecture,
( unordered_pair(y,unordered_pair(z,z)) = unordered_pair(w,w)
| member(unordered_pair(z,z),unordered_pair(w,unordered_pair(x,x))) ),
inference(cn,[status(thm)],[inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_13,c_0_18]),c_0_15])]) ).
cnf(c_0_21,negated_conjecture,
member(unordered_pair(y,y),unordered_pair(unordered_pair(w,w),unordered_pair(w,unordered_pair(x,x)))),
inference(cn,[status(thm)],[inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_19,c_0_14]),c_0_15])]) ).
cnf(c_0_22,negated_conjecture,
( unordered_pair(y,unordered_pair(z,z)) = unordered_pair(w,w)
| unordered_pair(z,z) = unordered_pair(x,x)
| unordered_pair(z,z) = w ),
inference(spm,[status(thm)],[c_0_16,c_0_20]) ).
cnf(c_0_23,negated_conjecture,
( unordered_pair(w,unordered_pair(x,x)) = unordered_pair(y,y)
| unordered_pair(w,w) = unordered_pair(y,y) ),
inference(spm,[status(thm)],[c_0_16,c_0_21]) ).
cnf(c_0_24,negated_conjecture,
( unordered_pair(z,z) = unordered_pair(x,x)
| unordered_pair(z,z) = w
| member(unordered_pair(z,z),unordered_pair(w,w)) ),
inference(cn,[status(thm)],[inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_13,c_0_22]),c_0_15])]) ).
cnf(c_0_25,negated_conjecture,
( unordered_pair(w,w) = unordered_pair(y,y)
| member(w,unordered_pair(y,y))
| ~ member(w,universal_class) ),
inference(spm,[status(thm)],[c_0_19,c_0_23]) ).
cnf(c_0_26,negated_conjecture,
( unordered_pair(z,z) = unordered_pair(x,x)
| unordered_pair(z,z) = w ),
inference(spm,[status(thm)],[c_0_16,c_0_24]) ).
cnf(c_0_27,negated_conjecture,
( unordered_pair(w,w) = unordered_pair(y,y)
| w = y
| ~ member(w,universal_class) ),
inference(spm,[status(thm)],[c_0_16,c_0_25]) ).
cnf(c_0_28,negated_conjecture,
( unordered_pair(z,z) = w
| X1 = z
| ~ member(X1,unordered_pair(x,x)) ),
inference(spm,[status(thm)],[c_0_16,c_0_26]) ).
cnf(c_0_29,negated_conjecture,
member(x,universal_class),
prove_ordered_pair_determines_components2_2 ).
cnf(c_0_30,negated_conjecture,
x != z,
prove_ordered_pair_determines_components2_3 ).
cnf(c_0_31,negated_conjecture,
( w = y
| member(w,unordered_pair(y,y))
| ~ member(w,universal_class) ),
inference(spm,[status(thm)],[c_0_19,c_0_27]) ).
cnf(c_0_32,negated_conjecture,
unordered_pair(z,z) = w,
inference(sr,[status(thm)],[inference(cn,[status(thm)],[inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_28,c_0_19]),c_0_29])]),c_0_30]) ).
cnf(c_0_33,negated_conjecture,
( w = y
| ~ member(w,universal_class) ),
inference(spm,[status(thm)],[c_0_16,c_0_31]) ).
cnf(c_0_34,negated_conjecture,
member(w,universal_class),
inference(spm,[status(thm)],[c_0_15,c_0_32]) ).
cnf(c_0_35,negated_conjecture,
w = y,
inference(cn,[status(thm)],[inference(rw,[status(thm)],[c_0_33,c_0_34])]) ).
cnf(c_0_36,negated_conjecture,
unordered_pair(z,z) = y,
inference(rw,[status(thm)],[c_0_32,c_0_35]) ).
cnf(c_0_37,negated_conjecture,
unordered_pair(unordered_pair(y,y),unordered_pair(y,unordered_pair(x,x))) = unordered_pair(unordered_pair(y,y),unordered_pair(y,y)),
inference(rw,[status(thm)],[inference(rw,[status(thm)],[inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_14,c_0_36]),c_0_35]),c_0_35]),c_0_35]) ).
cnf(c_0_38,negated_conjecture,
member(unordered_pair(y,unordered_pair(x,x)),unordered_pair(unordered_pair(y,y),unordered_pair(y,y))),
inference(cn,[status(thm)],[inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_13,c_0_37]),c_0_15])]) ).
cnf(c_0_39,negated_conjecture,
unordered_pair(y,unordered_pair(x,x)) = unordered_pair(y,y),
inference(spm,[status(thm)],[c_0_16,c_0_38]) ).
cnf(c_0_40,negated_conjecture,
member(unordered_pair(x,x),unordered_pair(y,y)),
inference(cn,[status(thm)],[inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_13,c_0_39]),c_0_15])]) ).
cnf(c_0_41,negated_conjecture,
unordered_pair(x,x) = y,
inference(spm,[status(thm)],[c_0_16,c_0_40]) ).
cnf(c_0_42,negated_conjecture,
( X1 = z
| ~ member(X1,y) ),
inference(spm,[status(thm)],[c_0_16,c_0_36]) ).
cnf(c_0_43,negated_conjecture,
member(x,y),
inference(cn,[status(thm)],[inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_19,c_0_41]),c_0_29])]) ).
cnf(c_0_44,negated_conjecture,
$false,
inference(sr,[status(thm)],[inference(spm,[status(thm)],[c_0_42,c_0_43]),c_0_30]),
[proof] ).
%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.09/0.11 % Problem : SET018-6 : TPTP v8.1.2. Bugfixed v2.1.0.
% 0.09/0.11 % Command : run_E %s %d THM
% 0.11/0.32 % Computer : n014.cluster.edu
% 0.11/0.32 % Model : x86_64 x86_64
% 0.11/0.32 % CPU : Intel(R) Xeon(R) CPU E5-2620 v4 @ 2.10GHz
% 0.11/0.32 % Memory : 8042.1875MB
% 0.11/0.32 % OS : Linux 3.10.0-693.el7.x86_64
% 0.11/0.32 % CPULimit : 2400
% 0.11/0.32 % WCLimit : 300
% 0.11/0.32 % DateTime : Mon Oct 2 17:27:49 EDT 2023
% 0.16/0.32 % 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/tmp/tmp.AhVgnNmidb/E---3.1_428.p
% 0.16/0.50 # Version: 3.1pre001
% 0.16/0.50 # Preprocessing class: FSLSSMSMSSSNFFN.
% 0.16/0.50 # Scheduled 4 strats onto 8 cores with 300 seconds (2400 total)
% 0.16/0.50 # Starting C07_19_nc_SOS_SAT001_MinMin_p005000_rr with 1500s (5) cores
% 0.16/0.50 # Starting new_bool_3 with 300s (1) cores
% 0.16/0.50 # Starting new_bool_1 with 300s (1) cores
% 0.16/0.50 # Starting sh5l with 300s (1) cores
% 0.16/0.50 # C07_19_nc_SOS_SAT001_MinMin_p005000_rr with pid 521 completed with status 0
% 0.16/0.50 # Result found by C07_19_nc_SOS_SAT001_MinMin_p005000_rr
% 0.16/0.50 # Preprocessing class: FSLSSMSMSSSNFFN.
% 0.16/0.50 # Scheduled 4 strats onto 8 cores with 300 seconds (2400 total)
% 0.16/0.50 # Starting C07_19_nc_SOS_SAT001_MinMin_p005000_rr with 1500s (5) cores
% 0.16/0.50 # No SInE strategy applied
% 0.16/0.50 # Search class: FGHSM-FFLM31-DFFFFFNN
% 0.16/0.50 # Scheduled 6 strats onto 5 cores with 1500 seconds (1500 total)
% 0.16/0.50 # Starting G-E--_208_C18_F1_SE_CS_SP_PS_S5PRR_RG_S04AN with 313s (1) cores
% 0.16/0.50 # Starting C07_19_nc_SOS_SAT001_MinMin_p005000_rr with 151s (1) cores
% 0.16/0.50 # Starting new_bool_1 with 308s (1) cores
% 0.16/0.50 # Starting sh5l with 304s (1) cores
% 0.16/0.50 # Starting G-E--_208_C18C--_F1_SE_CS_SP_PS_S5PRR_RG_S04AN with 136s (1) cores
% 0.16/0.50 # C07_19_nc_SOS_SAT001_MinMin_p005000_rr with pid 530 completed with status 0
% 0.16/0.50 # Result found by C07_19_nc_SOS_SAT001_MinMin_p005000_rr
% 0.16/0.50 # Preprocessing class: FSLSSMSMSSSNFFN.
% 0.16/0.50 # Scheduled 4 strats onto 8 cores with 300 seconds (2400 total)
% 0.16/0.50 # Starting C07_19_nc_SOS_SAT001_MinMin_p005000_rr with 1500s (5) cores
% 0.16/0.50 # No SInE strategy applied
% 0.16/0.50 # Search class: FGHSM-FFLM31-DFFFFFNN
% 0.16/0.50 # Scheduled 6 strats onto 5 cores with 1500 seconds (1500 total)
% 0.16/0.50 # Starting G-E--_208_C18_F1_SE_CS_SP_PS_S5PRR_RG_S04AN with 313s (1) cores
% 0.16/0.50 # Starting C07_19_nc_SOS_SAT001_MinMin_p005000_rr with 151s (1) cores
% 0.16/0.50 # Preprocessing time : 0.005 s
% 0.16/0.50 # Presaturation interreduction done
% 0.16/0.50
% 0.16/0.50 # Proof found!
% 0.16/0.50 # SZS status Unsatisfiable
% 0.16/0.50 # SZS output start CNFRefutation
% See solution above
% 0.16/0.50 # Parsed axioms : 94
% 0.16/0.50 # Removed by relevancy pruning/SinE : 0
% 0.16/0.50 # Initial clauses : 94
% 0.16/0.50 # Removed in clause preprocessing : 15
% 0.16/0.50 # Initial clauses in saturation : 79
% 0.16/0.50 # Processed clauses : 411
% 0.16/0.50 # ...of these trivial : 11
% 0.16/0.50 # ...subsumed : 71
% 0.16/0.50 # ...remaining for further processing : 329
% 0.16/0.50 # Other redundant clauses eliminated : 3
% 0.16/0.50 # Clauses deleted for lack of memory : 0
% 0.16/0.50 # Backward-subsumed : 21
% 0.16/0.50 # Backward-rewritten : 72
% 0.16/0.50 # Generated clauses : 1354
% 0.16/0.50 # ...of the previous two non-redundant : 1265
% 0.16/0.50 # ...aggressively subsumed : 0
% 0.16/0.50 # Contextual simplify-reflections : 3
% 0.16/0.50 # Paramodulations : 1348
% 0.16/0.50 # Factorizations : 3
% 0.16/0.50 # NegExts : 0
% 0.16/0.50 # Equation resolutions : 3
% 0.16/0.50 # Total rewrite steps : 322
% 0.16/0.50 # Propositional unsat checks : 0
% 0.16/0.50 # Propositional check models : 0
% 0.16/0.50 # Propositional check unsatisfiable : 0
% 0.16/0.50 # Propositional clauses : 0
% 0.16/0.50 # Propositional clauses after purity: 0
% 0.16/0.50 # Propositional unsat core size : 0
% 0.16/0.50 # Propositional preprocessing time : 0.000
% 0.16/0.50 # Propositional encoding time : 0.000
% 0.16/0.50 # Propositional solver time : 0.000
% 0.16/0.50 # Success case prop preproc time : 0.000
% 0.16/0.50 # Success case prop encoding time : 0.000
% 0.16/0.50 # Success case prop solver time : 0.000
% 0.16/0.50 # Current number of processed clauses : 155
% 0.16/0.50 # Positive orientable unit clauses : 29
% 0.16/0.50 # Positive unorientable unit clauses: 1
% 0.16/0.50 # Negative unit clauses : 1
% 0.16/0.50 # Non-unit-clauses : 124
% 0.16/0.50 # Current number of unprocessed clauses: 963
% 0.16/0.50 # ...number of literals in the above : 3559
% 0.16/0.50 # Current number of archived formulas : 0
% 0.16/0.50 # Current number of archived clauses : 186
% 0.16/0.50 # Clause-clause subsumption calls (NU) : 7288
% 0.16/0.50 # Rec. Clause-clause subsumption calls : 3919
% 0.16/0.50 # Non-unit clause-clause subsumptions : 91
% 0.16/0.50 # Unit Clause-clause subsumption calls : 531
% 0.16/0.50 # Rewrite failures with RHS unbound : 0
% 0.16/0.50 # BW rewrite match attempts : 21
% 0.16/0.50 # BW rewrite match successes : 13
% 0.16/0.50 # Condensation attempts : 0
% 0.16/0.50 # Condensation successes : 0
% 0.16/0.50 # Termbank termtop insertions : 44145
% 0.16/0.50
% 0.16/0.50 # -------------------------------------------------
% 0.16/0.50 # User time : 0.042 s
% 0.16/0.50 # System time : 0.008 s
% 0.16/0.50 # Total time : 0.050 s
% 0.16/0.50 # Maximum resident set size: 1976 pages
% 0.16/0.50
% 0.16/0.50 # -------------------------------------------------
% 0.16/0.50 # User time : 0.215 s
% 0.16/0.50 # System time : 0.027 s
% 0.16/0.50 # Total time : 0.241 s
% 0.16/0.50 # Maximum resident set size: 1756 pages
% 0.16/0.50 % E---3.1 exiting
%------------------------------------------------------------------------------