%------------------------------------------------------------------------------
% File : E-SAT---3.5.1
% Problem : SET072-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 : n007.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:23 PM UTC 2026
% Result : Unsatisfiable 0.14s 0.63s
% Output : CNFRefutation 0.14s
% Verified :
% SZS Type : Refutation
% Derivation depth : 8
% Number of leaves : 7
% Syntax : Number of clauses : 27 ( 13 unt; 3 nHn; 24 RR)
% Number of literals : 44 ( 14 equ; 17 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_pair2,axiom,
( ~ member(X1,universal_class)
| member(X1,unordered_pair(X1,X2)) ),
file('/export/starexec/sandbox2/benchmark/Axioms/SET004-0.ax',unordered_pair2) ).
cnf(cartesian_product1,axiom,
( ~ member(ordered_pair(X1,X2),cross_product(X3,X4))
| member(X1,X3) ),
file('/export/starexec/sandbox2/benchmark/Axioms/SET004-0.ax',cartesian_product1) ).
cnf(prove_right_cancellation_1,negated_conjecture,
unordered_pair(x,z) = unordered_pair(y,z),
file('/export/starexec/sandbox2/benchmark/theBenchmark.p',prove_right_cancellation_1) ).
cnf(prove_right_cancellation_2,negated_conjecture,
member(ordered_pair(x,y),cross_product(universal_class,universal_class)),
file('/export/starexec/sandbox2/benchmark/theBenchmark.p',prove_right_cancellation_2) ).
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(prove_right_cancellation_3,negated_conjecture,
x != y,
file('/export/starexec/sandbox2/benchmark/theBenchmark.p',prove_right_cancellation_3) ).
cnf(cartesian_product2,axiom,
( ~ member(ordered_pair(X1,X2),cross_product(X3,X4))
| member(X2,X4) ),
file('/export/starexec/sandbox2/benchmark/Axioms/SET004-0.ax',cartesian_product2) ).
cnf(c_0_7,plain,
( ~ member(X1,universal_class)
| member(X1,unordered_pair(X1,X2)) ),
inference(fof_simplification,[status(thm)],[unordered_pair2]) ).
cnf(c_0_8,plain,
( ~ member(ordered_pair(X1,X2),cross_product(X3,X4))
| member(X1,X3) ),
inference(fof_simplification,[status(thm)],[cartesian_product1]) ).
cnf(c_0_9,plain,
( ~ member(X1,universal_class)
| member(X1,unordered_pair(X1,X2)) ),
c_0_7 ).
cnf(c_0_10,negated_conjecture,
unordered_pair(x,z) = unordered_pair(y,z),
prove_right_cancellation_1 ).
cnf(c_0_11,plain,
( ~ member(ordered_pair(X1,X2),cross_product(X3,X4))
| member(X1,X3) ),
c_0_8 ).
cnf(c_0_12,negated_conjecture,
member(ordered_pair(x,y),cross_product(universal_class,universal_class)),
prove_right_cancellation_2 ).
cnf(c_0_13,plain,
( ~ member(X1,unordered_pair(X2,X3))
| X1 = X3
| X1 = X2 ),
inference(fof_simplification,[status(thm)],[unordered_pair_member]) ).
cnf(c_0_14,negated_conjecture,
( ~ member(x,universal_class)
| member(x,unordered_pair(y,z)) ),
inference(spm,[status(thm)],[c_0_9,c_0_10]) ).
cnf(c_0_15,negated_conjecture,
member(x,universal_class),
inference(spm,[status(thm)],[c_0_11,c_0_12]) ).
cnf(c_0_16,negated_conjecture,
x != y,
inference(fof_simplification,[status(thm)],[prove_right_cancellation_3]) ).
cnf(c_0_17,plain,
( ~ member(X1,unordered_pair(X2,X3))
| X1 = X3
| X1 = X2 ),
c_0_13 ).
cnf(c_0_18,negated_conjecture,
member(x,unordered_pair(y,z)),
inference(cn,[status(thm)],[inference(rw,[status(thm)],[c_0_14,c_0_15])]) ).
cnf(c_0_19,negated_conjecture,
x != y,
c_0_16 ).
cnf(c_0_20,negated_conjecture,
z = x,
inference(sr,[status(thm)],[inference(spm,[status(thm)],[c_0_17,c_0_18]),c_0_19]) ).
cnf(c_0_21,plain,
( ~ member(ordered_pair(X1,X2),cross_product(X3,X4))
| member(X2,X4) ),
inference(fof_simplification,[status(thm)],[cartesian_product2]) ).
cnf(c_0_22,negated_conjecture,
unordered_pair(x,x) = unordered_pair(y,x),
inference(rw,[status(thm)],[inference(rw,[status(thm)],[c_0_10,c_0_20]),c_0_20]) ).
cnf(c_0_23,plain,
( ~ member(ordered_pair(X1,X2),cross_product(X3,X4))
| member(X2,X4) ),
c_0_21 ).
cnf(c_0_24,negated_conjecture,
( ~ member(X1,unordered_pair(y,x))
| X1 = x ),
inference(spm,[status(thm)],[c_0_17,c_0_22]) ).
cnf(c_0_25,negated_conjecture,
member(y,universal_class),
inference(spm,[status(thm)],[c_0_23,c_0_12]) ).
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_19]),
[proof] ).
%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.00/0.03 % Problem : SET072-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.11/0.55 % Computer : n007.cluster.edu
% 0.11/0.55 % Model : x86_64 x86_64
% 0.11/0.55 % CPU : Intel(R) Xeon(R) CPU E5-2620 v4 @ 2.10GHz
% 0.11/0.55 % Memory : 8046.5625MB
% 0.11/0.55 % OS : Linux 6.8.0-71-generic
% 0.11/0.55 % CPULimit : 300
% 0.11/0.55 % WCLimit : 300
% 0.11/0.55 % DateTime : Mon Sep 21 04:48:21 UTC 2026
% 0.11/0.56 % CPUTime :
% 0.11/0.56 Running run_E /export/starexec/sandbox2/benchmark/theBenchmark.p 300 THM
% 0.14/0.61 Running first-order theorem proving
% 0.14/0.61 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.14/0.63 % Version: 3.5.1
% 0.14/0.63 % Preprocessing class: FSLSSMSMSSSNFFN.
% 0.14/0.63 % Scheduled 4 strats onto 8 cores with 300 seconds (2400 total)
% 0.14/0.63 % Starting C07_19_nc_SOS_SAT001_MinMin_p005000_rr with 1500s (5) cores
% 0.14/0.63 % Starting new_bool_3 with 300s (1) cores
% 0.14/0.63 % Starting new_bool_1 with 300s (1) cores
% 0.14/0.63 % Starting sh5l with 300s (1) cores
% 0.14/0.63 % new_bool_3 with pid 209567 completed with status 0
% 0.14/0.63 % Result found by new_bool_3
% 0.14/0.63 % Preprocessing class: FSLSSMSMSSSNFFN.
% 0.14/0.63 % Scheduled 4 strats onto 8 cores with 300 seconds (2400 total)
% 0.14/0.63 % Starting C07_19_nc_SOS_SAT001_MinMin_p005000_rr with 1500s (5) cores
% 0.14/0.63 % Starting new_bool_3 with 300s (1) cores
% 0.14/0.63 % (lift_lambdas = 0, lambda_to_forall = 0,unroll_only_formulas = 0, sine = GSinE(CountFormulas,hypos,1.5,,3,20000,1.0))
% 0.14/0.63 % SinE strategy is GSinE(CountFormulas,hypos,1.5,,3,20000,1.0)
% 0.14/0.63 % Search class: FGHSM-FFMF31-MFFFFFNN
% 0.14/0.63 % Scheduled 5 strats onto 1 cores with 300 seconds (300 total)
% 0.14/0.63 % Starting SubtermCWHack with 31s (1) cores
% 0.14/0.63 % SubtermCWHack with pid 209570 completed with status 0
% 0.14/0.63 % Result found by SubtermCWHack
% 0.14/0.63 % Preprocessing class: FSLSSMSMSSSNFFN.
% 0.14/0.63 % Scheduled 4 strats onto 8 cores with 300 seconds (2400 total)
% 0.14/0.63 % Starting C07_19_nc_SOS_SAT001_MinMin_p005000_rr with 1500s (5) cores
% 0.14/0.63 % Starting new_bool_3 with 300s (1) cores
% 0.14/0.63 % (lift_lambdas = 0, lambda_to_forall = 0,unroll_only_formulas = 0, sine = GSinE(CountFormulas,hypos,1.5,,3,20000,1.0))
% 0.14/0.63 % SinE strategy is GSinE(CountFormulas,hypos,1.5,,3,20000,1.0)
% 0.14/0.63 % Search class: FGHSM-FFMF31-MFFFFFNN
% 0.14/0.63 % Scheduled 5 strats onto 1 cores with 300 seconds (300 total)
% 0.14/0.63 % Starting SubtermCWHack with 31s (1) cores
% 0.14/0.63 % Preprocessing time : 0.002 s
% 0.14/0.63
% 0.14/0.63 % Proof found!
% 0.14/0.63 % SZS status Unsatisfiable
% 0.14/0.63 % SZS output start CNFRefutation
% See solution above
% 0.14/0.63 % Parsed axioms : 94
% 0.14/0.63 % Removed by relevancy pruning/SinE : 66
% 0.14/0.63 % Initial clauses : 28
% 0.14/0.63 % Removed in clause preprocessing : 0
% 0.14/0.63 % Initial clauses in saturation : 28
% 0.14/0.63 % Processed clauses : 41
% 0.14/0.63 % ...of these trivial : 0
% 0.14/0.63 % ...subsumed : 4
% 0.14/0.63 % ...remaining for further processing : 37
% 0.14/0.63 % Other redundant clauses eliminated : 2
% 0.14/0.63 % Clauses deleted for lack of memory : 0
% 0.14/0.63 % Backward-subsumed : 0
% 0.14/0.63 % Backward-rewritten : 2
% 0.14/0.63 % Generated clauses : 45
% 0.14/0.63 % ...of the previous two non-redundant : 28
% 0.14/0.63 % ...aggressively subsumed : 0
% 0.14/0.63 % Contextual simplify-reflections : 0
% 0.14/0.63 % Paramodulations : 43
% 0.14/0.63 % Factorizations : 0
% 0.14/0.63 % NegExts : 0
% 0.14/0.63 % Equation resolutions : 2
% 0.14/0.63 % Disequality decompositions : 0
% 0.14/0.63 % Total rewrite steps : 19
% 0.14/0.63 % ...of those cached : 8
% 0.14/0.63 % Propositional unsat checks : 0
% 0.14/0.63 % Propositional check models : 0
% 0.14/0.63 % Propositional check unsatisfiable : 0
% 0.14/0.63 % Propositional clauses : 0
% 0.14/0.63 % Propositional clauses after purity: 0
% 0.14/0.63 % Propositional unsat core size : 0
% 0.14/0.63 % Propositional preprocessing time : 0.000
% 0.14/0.63 % Propositional encoding time : 0.000
% 0.14/0.63 % Propositional solver time : 0.000
% 0.14/0.63 % Success case prop preproc time : 0.000
% 0.14/0.63 % Success case prop encoding time : 0.000
% 0.14/0.63 % Success case prop solver time : 0.000
% 0.14/0.63 % Current number of processed clauses : 33
% 0.14/0.63 % Positive orientable unit clauses : 16
% 0.14/0.63 % Positive unorientable unit clauses: 1
% 0.14/0.63 % Negative unit clauses : 1
% 0.14/0.63 % Non-unit-clauses : 15
% 0.14/0.63 % Current number of unprocessed clauses: 15
% 0.14/0.63 % ...number of literals in the above : 36
% 0.14/0.63 % Current number of archived formulas : 0
% 0.14/0.63 % Current number of archived clauses : 2
% 0.14/0.63 % Clause-clause subsumption calls (NU) : 49
% 0.14/0.63 % Rec. Clause-clause subsumption calls : 43
% 0.14/0.63 % Non-unit clause-clause subsumptions : 4
% 0.14/0.63 % Unit Clause-clause subsumption calls : 3
% 0.14/0.63 % Rewrite failures with RHS unbound : 0
% 0.14/0.63 % BW rewrite match attempts : 4
% 0.14/0.63 % BW rewrite match successes : 2
% 0.14/0.63 % Condensation attempts : 0
% 0.14/0.63 % Condensation successes : 0
% 0.14/0.63 % Termbank termtop insertions : 1671
% 0.14/0.63 % Search garbage collected termcells : 351
% 0.14/0.63
% 0.14/0.63 % -------------------------------------------------
% 0.14/0.63 % User time : 0.003 s
% 0.14/0.63 % System time : 0.004 s
% 0.14/0.63 % Total time : 0.007 s
% 0.14/0.63 % Maximum resident set size: 3720 pages
% 0.14/0.63
% 0.14/0.63 % -------------------------------------------------
% 0.14/0.63 % User time : 0.007 s
% 0.14/0.63 % System time : 0.008 s
% 0.14/0.63 % Total time : 0.015 s
% 0.14/0.63 % Maximum resident set size: 4608 pages
% 0.14/0.63 % E exiting
%------------------------------------------------------------------------------