%------------------------------------------------------------------------------
% File : E-SAT---3.5.1
% Problem : SET018-6 : TPTP v9.3.1. Bugfixed v2.1.0.
% Transfm : none
% Format : tptp:raw
% Command : run_E /export/starexec/sandbox2/benchmark/theBenchmark.p 300 THM
% Computer : n016.cluster.edu
% Model : x86_64 x86_64
% CPU : Intel(R) Xeon(R) CPU E5-2620 v4 2.10GHz
% Memory : 8046.5625MB
% OS : Linux 6.8.0-71-generic
% CPULimit : 300s
% WCLimit : 300s
% DateTime : Thu Sep 24 02:16:04 PM UTC 2026
% Result : Unsatisfiable 0.73s 0.54s
% Output : CNFRefutation 0.73s
% Verified :
% SZS Type : Refutation
% Derivation depth : 21
% Number of leaves : 9
% Syntax : Number of clauses : 49 ( 28 unt; 13 nHn; 36 RR)
% Number of literals : 79 ( 43 equ; 18 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 : 35 ( 10 sgn)
% Comments :
%------------------------------------------------------------------------------
cnf(ordered_pair,axiom,
unordered_pair(singleton(X1),unordered_pair(X1,singleton(X2))) = ordered_pair(X1,X2),
file('/export/starexec/sandbox2/benchmark/Axioms/SET004-0.ax',ordered_pair) ).
cnf(singleton_set,axiom,
unordered_pair(X1,X1) = singleton(X1),
file('/export/starexec/sandbox2/benchmark/Axioms/SET004-0.ax',singleton_set) ).
cnf(unordered_pair3,axiom,
( ~ member(X1,universal_class)
| member(X1,unordered_pair(X2,X1)) ),
file('/export/starexec/sandbox2/benchmark/Axioms/SET004-0.ax',unordered_pair3) ).
cnf(prove_ordered_pair_determines_components2_1,negated_conjecture,
ordered_pair(w,x) = ordered_pair(y,z),
file('/export/starexec/sandbox2/benchmark/theBenchmark.p',prove_ordered_pair_determines_components2_1) ).
cnf(unordered_pair_member,axiom,
( ~ member(X1,unordered_pair(X2,X3))
| X1 = X3
| X1 = X2 ),
file('/export/starexec/sandbox2/benchmark/Axioms/SET004-0.ax',unordered_pair_member) ).
cnf(unordered_pairs_in_universal,axiom,
member(unordered_pair(X1,X2),universal_class),
file('/export/starexec/sandbox2/benchmark/Axioms/SET004-0.ax',unordered_pairs_in_universal) ).
cnf(unordered_pair2,axiom,
( ~ member(X1,universal_class)
| member(X1,unordered_pair(X1,X2)) ),
file('/export/starexec/sandbox2/benchmark/Axioms/SET004-0.ax',unordered_pair2) ).
cnf(prove_ordered_pair_determines_components2_3,negated_conjecture,
x != z,
file('/export/starexec/sandbox2/benchmark/theBenchmark.p',prove_ordered_pair_determines_components2_3) ).
cnf(prove_ordered_pair_determines_components2_2,negated_conjecture,
member(x,universal_class),
file('/export/starexec/sandbox2/benchmark/theBenchmark.p',prove_ordered_pair_determines_components2_2) ).
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,plain,
( ~ member(X1,universal_class)
| member(X1,unordered_pair(X2,X1)) ),
inference(fof_simplification,[status(thm)],[unordered_pair3]) ).
cnf(c_0_12,negated_conjecture,
ordered_pair(w,x) = ordered_pair(y,z),
prove_ordered_pair_determines_components2_1 ).
cnf(c_0_13,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_14,plain,
( ~ member(X1,unordered_pair(X2,X3))
| X1 = X3
| X1 = X2 ),
inference(fof_simplification,[status(thm)],[unordered_pair_member]) ).
cnf(c_0_15,plain,
( ~ member(X1,universal_class)
| member(X1,unordered_pair(X2,X1)) ),
c_0_11 ).
cnf(c_0_16,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_12,c_0_13]),c_0_13]) ).
cnf(c_0_17,axiom,
member(unordered_pair(X1,X2),universal_class),
unordered_pairs_in_universal ).
cnf(c_0_18,plain,
( ~ member(X1,unordered_pair(X2,X3))
| X1 = X3
| X1 = X2 ),
c_0_14 ).
cnf(c_0_19,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_15,c_0_16]),c_0_17])]) ).
cnf(c_0_20,plain,
( ~ member(X1,universal_class)
| member(X1,unordered_pair(X1,X2)) ),
inference(fof_simplification,[status(thm)],[unordered_pair2]) ).
cnf(c_0_21,negated_conjecture,
( unordered_pair(y,unordered_pair(z,z)) = unordered_pair(w,w)
| unordered_pair(y,unordered_pair(z,z)) = unordered_pair(w,unordered_pair(x,x)) ),
inference(spm,[status(thm)],[c_0_18,c_0_19]) ).
cnf(c_0_22,plain,
( ~ member(X1,universal_class)
| member(X1,unordered_pair(X1,X2)) ),
c_0_20 ).
cnf(c_0_23,negated_conjecture,
( member(unordered_pair(z,z),unordered_pair(w,unordered_pair(x,x)))
| unordered_pair(y,unordered_pair(z,z)) = unordered_pair(w,w) ),
inference(cn,[status(thm)],[inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_15,c_0_21]),c_0_17])]) ).
cnf(c_0_24,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_22,c_0_16]),c_0_17])]) ).
cnf(c_0_25,negated_conjecture,
( unordered_pair(z,z) = w
| unordered_pair(z,z) = unordered_pair(x,x)
| unordered_pair(y,unordered_pair(z,z)) = unordered_pair(w,w) ),
inference(spm,[status(thm)],[c_0_18,c_0_23]) ).
cnf(c_0_26,negated_conjecture,
( unordered_pair(w,w) = unordered_pair(y,y)
| unordered_pair(w,unordered_pair(x,x)) = unordered_pair(y,y) ),
inference(spm,[status(thm)],[c_0_18,c_0_24]) ).
cnf(c_0_27,negated_conjecture,
( member(unordered_pair(z,z),unordered_pair(w,w))
| unordered_pair(z,z) = w
| unordered_pair(z,z) = unordered_pair(x,x) ),
inference(cn,[status(thm)],[inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_15,c_0_25]),c_0_17])]) ).
cnf(c_0_28,negated_conjecture,
( ~ member(w,universal_class)
| member(w,unordered_pair(y,y))
| unordered_pair(w,w) = unordered_pair(y,y) ),
inference(spm,[status(thm)],[c_0_22,c_0_26]) ).
cnf(c_0_29,negated_conjecture,
( unordered_pair(z,z) = w
| unordered_pair(z,z) = unordered_pair(x,x) ),
inference(spm,[status(thm)],[c_0_18,c_0_27]) ).
cnf(c_0_30,negated_conjecture,
x != z,
inference(fof_simplification,[status(thm)],[prove_ordered_pair_determines_components2_3]) ).
cnf(c_0_31,negated_conjecture,
( ~ member(w,universal_class)
| w = y
| unordered_pair(w,w) = unordered_pair(y,y) ),
inference(spm,[status(thm)],[c_0_18,c_0_28]) ).
cnf(c_0_32,negated_conjecture,
( ~ member(X1,unordered_pair(x,x))
| X1 = z
| unordered_pair(z,z) = w ),
inference(spm,[status(thm)],[c_0_18,c_0_29]) ).
cnf(c_0_33,negated_conjecture,
member(x,universal_class),
prove_ordered_pair_determines_components2_2 ).
cnf(c_0_34,negated_conjecture,
x != z,
c_0_30 ).
cnf(c_0_35,negated_conjecture,
( ~ member(w,universal_class)
| member(w,unordered_pair(y,y))
| w = y ),
inference(spm,[status(thm)],[c_0_22,c_0_31]) ).
cnf(c_0_36,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_32,c_0_22]),c_0_33])]),c_0_34]) ).
cnf(c_0_37,negated_conjecture,
( ~ member(w,universal_class)
| w = y ),
inference(spm,[status(thm)],[c_0_18,c_0_35]) ).
cnf(c_0_38,negated_conjecture,
member(w,universal_class),
inference(spm,[status(thm)],[c_0_17,c_0_36]) ).
cnf(c_0_39,negated_conjecture,
w = y,
inference(cn,[status(thm)],[inference(rw,[status(thm)],[c_0_37,c_0_38])]) ).
cnf(c_0_40,negated_conjecture,
unordered_pair(z,z) = y,
inference(rw,[status(thm)],[c_0_36,c_0_39]) ).
cnf(c_0_41,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_16,c_0_40]),c_0_39]),c_0_39]),c_0_39]) ).
cnf(c_0_42,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_15,c_0_41]),c_0_17])]) ).
cnf(c_0_43,negated_conjecture,
unordered_pair(y,unordered_pair(x,x)) = unordered_pair(y,y),
inference(spm,[status(thm)],[c_0_18,c_0_42]) ).
cnf(c_0_44,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_15,c_0_43]),c_0_17])]) ).
cnf(c_0_45,negated_conjecture,
unordered_pair(x,x) = y,
inference(spm,[status(thm)],[c_0_18,c_0_44]) ).
cnf(c_0_46,negated_conjecture,
( ~ member(X1,y)
| X1 = z ),
inference(spm,[status(thm)],[c_0_18,c_0_40]) ).
cnf(c_0_47,negated_conjecture,
member(x,y),
inference(cn,[status(thm)],[inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_22,c_0_45]),c_0_33])]) ).
cnf(c_0_48,negated_conjecture,
$false,
inference(sr,[status(thm)],[inference(spm,[status(thm)],[c_0_46,c_0_47]),c_0_34]),
[proof] ).
%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.00/0.03 % Problem : SET018-6 : TPTP v9.3.1. Bugfixed v2.1.0.
% 0.00/0.05 % Command : run_E /export/starexec/sandbox2/benchmark/theBenchmark.p 300 THM
% 0.10/0.36 % Computer : n016.cluster.edu
% 0.10/0.36 % Model : x86_64 x86_64
% 0.10/0.36 % CPU : Intel(R) Xeon(R) CPU E5-2620 v4 @ 2.10GHz
% 0.10/0.36 % Memory : 8046.5625MB
% 0.10/0.36 % OS : Linux 6.8.0-71-generic
% 0.10/0.36 % CPULimit : 300
% 0.10/0.36 % WCLimit : 300
% 0.10/0.36 % DateTime : Mon Sep 21 04:47:37 UTC 2026
% 0.10/0.37 % CPUTime :
% 0.10/0.37 Running run_E /export/starexec/sandbox2/benchmark/theBenchmark.p 300 THM
% 0.14/0.40 Running first-order theorem proving
% 0.14/0.40 Running: /export/starexec/sandbox2/solver/bin/eprover --delete-bad-limit=2000000000 --definitional-cnf=24 -s --print-statistics -R --print-version --proof-object --auto-schedule=8 --cpu-limit=300 /export/starexec/sandbox2/benchmark/theBenchmark.p
% 0.73/0.54 % Version: 3.5.1
% 0.73/0.54 % Preprocessing class: FSLSSMSMSSSNFFN.
% 0.73/0.54 % Scheduled 4 strats onto 8 cores with 300 seconds (2400 total)
% 0.73/0.54 % Starting C07_19_nc_SOS_SAT001_MinMin_p005000_rr with 1500s (5) cores
% 0.73/0.54 % Starting new_bool_3 with 300s (1) cores
% 0.73/0.54 % Starting new_bool_1 with 300s (1) cores
% 0.73/0.54 % Starting sh5l with 300s (1) cores
% 0.73/0.54 % C07_19_nc_SOS_SAT001_MinMin_p005000_rr with pid 1583353 completed with status 0
% 0.73/0.54 % Result found by C07_19_nc_SOS_SAT001_MinMin_p005000_rr
% 0.73/0.54 % Preprocessing class: FSLSSMSMSSSNFFN.
% 0.73/0.54 % Scheduled 4 strats onto 8 cores with 300 seconds (2400 total)
% 0.73/0.54 % Starting C07_19_nc_SOS_SAT001_MinMin_p005000_rr with 1500s (5) cores
% 0.73/0.54 % (lift_lambdas = 1, lambda_to_forall = 1,unroll_only_formulas = 1, sine = Auto)
% 0.73/0.54 % No SInE strategy applied
% 0.73/0.54 % Search class: FGHSM-FFLM31-DFFFFFNN
% 0.73/0.54 % Scheduled 7 strats onto 5 cores with 1500 seconds (1500 total)
% 0.73/0.54 % Starting SubtermCWHack with 136s (1) cores
% 0.73/0.54 % Starting C07_19_nc_SOS_SAT001_MinMin_p005000_rr with 151s (1) cores
% 0.73/0.54 % Starting new_bool_3 with 311s (1) cores
% 0.73/0.54 % Starting new_bool_1 with 308s (1) cores
% 0.73/0.54 % Starting sh5l with 304s (1) cores
% 0.73/0.54 % C07_19_nc_SOS_SAT001_MinMin_p005000_rr with pid 1583361 completed with status 0
% 0.73/0.54 % Result found by C07_19_nc_SOS_SAT001_MinMin_p005000_rr
% 0.73/0.54 % Preprocessing class: FSLSSMSMSSSNFFN.
% 0.73/0.54 % Scheduled 4 strats onto 8 cores with 300 seconds (2400 total)
% 0.73/0.54 % Starting C07_19_nc_SOS_SAT001_MinMin_p005000_rr with 1500s (5) cores
% 0.73/0.54 % (lift_lambdas = 1, lambda_to_forall = 1,unroll_only_formulas = 1, sine = Auto)
% 0.73/0.54 % No SInE strategy applied
% 0.73/0.54 % Search class: FGHSM-FFLM31-DFFFFFNN
% 0.73/0.54 % Scheduled 7 strats onto 5 cores with 1500 seconds (1500 total)
% 0.73/0.54 % Starting SubtermCWHack with 136s (1) cores
% 0.73/0.54 % Starting C07_19_nc_SOS_SAT001_MinMin_p005000_rr with 151s (1) cores
% 0.73/0.54 % Preprocessing time : 0.003 s
% 0.73/0.54 % Presaturation interreduction done
% 0.73/0.54
% 0.73/0.54 % Proof found!
% 0.73/0.54 % SZS status Unsatisfiable
% 0.73/0.54 % SZS output start CNFRefutation
% See solution above
% 0.73/0.54 % Parsed axioms : 94
% 0.73/0.54 % Removed by relevancy pruning/SinE : 0
% 0.73/0.54 % Initial clauses : 94
% 0.73/0.54 % Removed in clause preprocessing : 15
% 0.73/0.54 % Initial clauses in saturation : 79
% 0.73/0.54 % Processed clauses : 411
% 0.73/0.54 % ...of these trivial : 11
% 0.73/0.54 % ...subsumed : 71
% 0.73/0.54 % ...remaining for further processing : 329
% 0.73/0.54 % Other redundant clauses eliminated : 3
% 0.73/0.54 % Clauses deleted for lack of memory : 0
% 0.73/0.54 % Backward-subsumed : 21
% 0.73/0.54 % Backward-rewritten : 72
% 0.73/0.54 % Generated clauses : 1354
% 0.73/0.54 % ...of the previous two non-redundant : 1265
% 0.73/0.54 % ...aggressively subsumed : 0
% 0.73/0.54 % Contextual simplify-reflections : 3
% 0.73/0.54 % Paramodulations : 1348
% 0.73/0.54 % Factorizations : 3
% 0.73/0.54 % NegExts : 0
% 0.73/0.54 % Equation resolutions : 3
% 0.73/0.54 % Disequality decompositions : 0
% 0.73/0.54 % Total rewrite steps : 322
% 0.73/0.54 % ...of those cached : 287
% 0.73/0.54 % Propositional unsat checks : 0
% 0.73/0.54 % Propositional check models : 0
% 0.73/0.54 % Propositional check unsatisfiable : 0
% 0.73/0.54 % Propositional clauses : 0
% 0.73/0.54 % Propositional clauses after purity: 0
% 0.73/0.54 % Propositional unsat core size : 0
% 0.73/0.54 % Propositional preprocessing time : 0.000
% 0.73/0.54 % Propositional encoding time : 0.000
% 0.73/0.54 % Propositional solver time : 0.000
% 0.73/0.54 % Success case prop preproc time : 0.000
% 0.73/0.54 % Success case prop encoding time : 0.000
% 0.73/0.54 % Success case prop solver time : 0.000
% 0.73/0.54 % Current number of processed clauses : 155
% 0.73/0.54 % Positive orientable unit clauses : 29
% 0.73/0.54 % Positive unorientable unit clauses: 1
% 0.73/0.54 % Negative unit clauses : 1
% 0.73/0.54 % Non-unit-clauses : 124
% 0.73/0.54 % Current number of unprocessed clauses: 963
% 0.73/0.54 % ...number of literals in the above : 3559
% 0.73/0.54 % Current number of archived formulas : 0
% 0.73/0.54 % Current number of archived clauses : 186
% 0.73/0.54 % Clause-clause subsumption calls (NU) : 5470
% 0.73/0.54 % Rec. Clause-clause subsumption calls : 3530
% 0.73/0.54 % Non-unit clause-clause subsumptions : 91
% 0.73/0.54 % Unit Clause-clause subsumption calls : 460
% 0.73/0.54 % Rewrite failures with RHS unbound : 0
% 0.73/0.54 % BW rewrite match attempts : 21
% 0.73/0.54 % BW rewrite match successes : 13
% 0.73/0.54 % Condensation attempts : 0
% 0.73/0.54 % Condensation successes : 0
% 0.73/0.54 % Termbank termtop insertions : 44838
% 0.73/0.54 % Search garbage collected termcells : 156
% 0.73/0.54
% 0.73/0.54 % -------------------------------------------------
% 0.73/0.54 % User time : 0.090 s
% 0.73/0.54 % System time : 0.009 s
% 0.73/0.54 % Total time : 0.099 s
% 0.73/0.54 % Maximum resident set size: 3720 pages
% 0.73/0.54
% 0.73/0.54 % -------------------------------------------------
% 0.73/0.54 % User time : 0.396 s
% 0.73/0.54 % System time : 0.026 s
% 0.73/0.54 % Total time : 0.422 s
% 0.73/0.54 % Maximum resident set size: 4608 pages
% 0.73/0.54 % E exiting
%------------------------------------------------------------------------------