%------------------------------------------------------------------------------
% File : E-SAT---3.5.1
% Problem : SET051-6 : TPTP v9.3.1. Bugfixed v2.1.0.
% Transfm : none
% Format : tptp:raw
% Command : run_E /export/starexec/sandbox/benchmark/theBenchmark.p 300 THM
% Computer : n020.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:15 PM UTC 2026
% Result : Unsatisfiable 0.15s 0.66s
% Output : CNFRefutation 0.15s
% Verified :
% SZS Type : Refutation
% Derivation depth : 4
% Number of leaves : 6
% Syntax : Number of clauses : 20 ( 10 unt; 0 nHn; 15 RR)
% Number of literals : 33 ( 0 equ; 17 neg)
% Maximal clause size : 3 ( 1 avg)
% Maximal term depth : 2 ( 1 avg)
% Number of predicates : 3 ( 2 usr; 1 prp; 0-2 aty)
% Number of functors : 8 ( 8 usr; 5 con; 0-2 aty)
% Number of variables : 31 ( 12 sgn)
% Comments :
%------------------------------------------------------------------------------
cnf(subclass_members,axiom,
( ~ member(X3,X1)
| ~ subclass(X1,X2)
| member(X3,X2) ),
file('/export/starexec/sandbox/benchmark/Axioms/SET004-0.ax',subclass_members) ).
cnf(cartesian_product2,axiom,
( ~ member(ordered_pair(X1,X2),cross_product(X3,X4))
| member(X2,X4) ),
file('/export/starexec/sandbox/benchmark/Axioms/SET004-0.ax',cartesian_product2) ).
cnf(prove_corollary_2_to_unordered_pair_2,negated_conjecture,
~ member(y,unordered_pair(x,y)),
file('/export/starexec/sandbox/benchmark/theBenchmark.p',prove_corollary_2_to_unordered_pair_2) ).
cnf(unordered_pair3,axiom,
( ~ member(X1,universal_class)
| member(X1,unordered_pair(X2,X1)) ),
file('/export/starexec/sandbox/benchmark/Axioms/SET004-0.ax',unordered_pair3) ).
cnf(class_elements_are_sets,axiom,
subclass(X1,universal_class),
file('/export/starexec/sandbox/benchmark/Axioms/SET004-0.ax',class_elements_are_sets) ).
cnf(prove_corollary_2_to_unordered_pair_1,negated_conjecture,
member(ordered_pair(x,y),cross_product(u,v)),
file('/export/starexec/sandbox/benchmark/theBenchmark.p',prove_corollary_2_to_unordered_pair_1) ).
cnf(c_0_6,plain,
( ~ member(X3,X1)
| ~ subclass(X1,X2)
| member(X3,X2) ),
inference(fof_simplification,[status(thm)],[subclass_members]) ).
cnf(c_0_7,plain,
( ~ member(ordered_pair(X1,X2),cross_product(X3,X4))
| member(X2,X4) ),
inference(fof_simplification,[status(thm)],[cartesian_product2]) ).
cnf(c_0_8,negated_conjecture,
~ member(y,unordered_pair(x,y)),
inference(fof_simplification,[status(thm)],[prove_corollary_2_to_unordered_pair_2]) ).
cnf(c_0_9,plain,
( ~ member(X1,universal_class)
| member(X1,unordered_pair(X2,X1)) ),
inference(fof_simplification,[status(thm)],[unordered_pair3]) ).
cnf(c_0_10,plain,
( ~ member(X3,X1)
| ~ subclass(X1,X2)
| member(X3,X2) ),
c_0_6 ).
cnf(c_0_11,axiom,
subclass(X1,universal_class),
class_elements_are_sets ).
cnf(c_0_12,plain,
( ~ member(ordered_pair(X1,X2),cross_product(X3,X4))
| member(X2,X4) ),
c_0_7 ).
cnf(c_0_13,negated_conjecture,
member(ordered_pair(x,y),cross_product(u,v)),
prove_corollary_2_to_unordered_pair_1 ).
cnf(c_0_14,negated_conjecture,
~ member(y,unordered_pair(x,y)),
c_0_8 ).
cnf(c_0_15,plain,
( ~ member(X1,universal_class)
| member(X1,unordered_pair(X2,X1)) ),
c_0_9 ).
cnf(c_0_16,plain,
( ~ member(X1,X2)
| member(X1,universal_class) ),
inference(spm,[status(thm)],[c_0_10,c_0_11]) ).
cnf(c_0_17,negated_conjecture,
member(y,v),
inference(spm,[status(thm)],[c_0_12,c_0_13]) ).
cnf(c_0_18,negated_conjecture,
~ member(y,universal_class),
inference(spm,[status(thm)],[c_0_14,c_0_15]) ).
cnf(c_0_19,negated_conjecture,
$false,
inference(sr,[status(thm)],[inference(spm,[status(thm)],[c_0_16,c_0_17]),c_0_18]),
[proof] ).
%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.00/0.03 % Problem : SET051-6 : TPTP v9.3.1. Bugfixed v2.1.0.
% 0.00/0.05 % Command : run_E /export/starexec/sandbox/benchmark/theBenchmark.p 300 THM
% 0.11/0.59 % Computer : n020.cluster.edu
% 0.11/0.59 % Model : x86_64 x86_64
% 0.11/0.59 % CPU : Intel(R) Xeon(R) CPU E5-2620 v4 @ 2.10GHz
% 0.11/0.59 % Memory : 8046.5625MB
% 0.11/0.59 % OS : Linux 6.8.0-71-generic
% 0.11/0.59 % CPULimit : 300
% 0.11/0.59 % WCLimit : 300
% 0.11/0.59 % DateTime : Mon Sep 21 04:48:49 UTC 2026
% 0.11/0.59 % CPUTime :
% 0.11/0.59 Running run_E /export/starexec/sandbox/benchmark/theBenchmark.p 300 THM
% 0.15/0.63 Running first-order theorem proving
% 0.15/0.63 Running: /export/starexec/sandbox/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/sandbox/benchmark/theBenchmark.p
% 0.15/0.66 % Version: 3.5.1
% 0.15/0.66 % Preprocessing class: FSLSSMSMSSSNFFN.
% 0.15/0.66 % Scheduled 4 strats onto 8 cores with 300 seconds (2400 total)
% 0.15/0.66 % Starting C07_19_nc_SOS_SAT001_MinMin_p005000_rr with 1500s (5) cores
% 0.15/0.66 % Starting new_bool_3 with 300s (1) cores
% 0.15/0.66 % Starting new_bool_1 with 300s (1) cores
% 0.15/0.66 % Starting sh5l with 300s (1) cores
% 0.15/0.66 % new_bool_3 with pid 2034510 completed with status 0
% 0.15/0.66 % Result found by new_bool_3
% 0.15/0.66 % Preprocessing class: FSLSSMSMSSSNFFN.
% 0.15/0.66 % Scheduled 4 strats onto 8 cores with 300 seconds (2400 total)
% 0.15/0.66 % Starting C07_19_nc_SOS_SAT001_MinMin_p005000_rr with 1500s (5) cores
% 0.15/0.66 % Starting new_bool_3 with 300s (1) cores
% 0.15/0.66 % (lift_lambdas = 0, lambda_to_forall = 0,unroll_only_formulas = 0, sine = GSinE(CountFormulas,hypos,1.5,,3,20000,1.0))
% 0.15/0.66 % SinE strategy is GSinE(CountFormulas,hypos,1.5,,3,20000,1.0)
% 0.15/0.66 % Search class: FGHSM-FFMF31-MFFFFFNN
% 0.15/0.66 % Scheduled 5 strats onto 1 cores with 300 seconds (300 total)
% 0.15/0.66 % Starting SubtermCWHack with 31s (1) cores
% 0.15/0.66 % SubtermCWHack with pid 2034514 completed with status 0
% 0.15/0.66 % Result found by SubtermCWHack
% 0.15/0.66 % Preprocessing class: FSLSSMSMSSSNFFN.
% 0.15/0.66 % Scheduled 4 strats onto 8 cores with 300 seconds (2400 total)
% 0.15/0.66 % Starting C07_19_nc_SOS_SAT001_MinMin_p005000_rr with 1500s (5) cores
% 0.15/0.66 % Starting new_bool_3 with 300s (1) cores
% 0.15/0.66 % (lift_lambdas = 0, lambda_to_forall = 0,unroll_only_formulas = 0, sine = GSinE(CountFormulas,hypos,1.5,,3,20000,1.0))
% 0.15/0.66 % SinE strategy is GSinE(CountFormulas,hypos,1.5,,3,20000,1.0)
% 0.15/0.66 % Search class: FGHSM-FFMF31-MFFFFFNN
% 0.15/0.66 % Scheduled 5 strats onto 1 cores with 300 seconds (300 total)
% 0.15/0.66 % Starting SubtermCWHack with 31s (1) cores
% 0.15/0.66 % Preprocessing time : 0.002 s
% 0.15/0.66
% 0.15/0.66 % Proof found!
% 0.15/0.66 % SZS status Unsatisfiable
% 0.15/0.66 % SZS output start CNFRefutation
% See solution above
% 0.15/0.66 % Parsed axioms : 93
% 0.15/0.66 % Removed by relevancy pruning/SinE : 66
% 0.15/0.66 % Initial clauses : 27
% 0.15/0.66 % Removed in clause preprocessing : 0
% 0.15/0.66 % Initial clauses in saturation : 27
% 0.15/0.66 % Processed clauses : 28
% 0.15/0.66 % ...of these trivial : 0
% 0.15/0.66 % ...subsumed : 2
% 0.15/0.66 % ...remaining for further processing : 26
% 0.15/0.66 % Other redundant clauses eliminated : 2
% 0.15/0.66 % Clauses deleted for lack of memory : 0
% 0.15/0.66 % Backward-subsumed : 0
% 0.15/0.66 % Backward-rewritten : 0
% 0.15/0.66 % Generated clauses : 26
% 0.15/0.66 % ...of the previous two non-redundant : 16
% 0.15/0.66 % ...aggressively subsumed : 0
% 0.15/0.66 % Contextual simplify-reflections : 0
% 0.15/0.66 % Paramodulations : 24
% 0.15/0.66 % Factorizations : 0
% 0.15/0.66 % NegExts : 0
% 0.15/0.66 % Equation resolutions : 2
% 0.15/0.66 % Disequality decompositions : 0
% 0.15/0.66 % Total rewrite steps : 5
% 0.15/0.66 % ...of those cached : 0
% 0.15/0.66 % Propositional unsat checks : 0
% 0.15/0.66 % Propositional check models : 0
% 0.15/0.66 % Propositional check unsatisfiable : 0
% 0.15/0.66 % Propositional clauses : 0
% 0.15/0.66 % Propositional clauses after purity: 0
% 0.15/0.66 % Propositional unsat core size : 0
% 0.15/0.66 % Propositional preprocessing time : 0.000
% 0.15/0.66 % Propositional encoding time : 0.000
% 0.15/0.66 % Propositional solver time : 0.000
% 0.15/0.66 % Success case prop preproc time : 0.000
% 0.15/0.66 % Success case prop encoding time : 0.000
% 0.15/0.66 % Success case prop solver time : 0.000
% 0.15/0.66 % Current number of processed clauses : 24
% 0.15/0.66 % Positive orientable unit clauses : 11
% 0.15/0.66 % Positive unorientable unit clauses: 1
% 0.15/0.66 % Negative unit clauses : 2
% 0.15/0.66 % Non-unit-clauses : 10
% 0.15/0.66 % Current number of unprocessed clauses: 15
% 0.15/0.66 % ...number of literals in the above : 36
% 0.15/0.66 % Current number of archived formulas : 0
% 0.15/0.66 % Current number of archived clauses : 0
% 0.15/0.66 % Clause-clause subsumption calls (NU) : 8
% 0.15/0.66 % Rec. Clause-clause subsumption calls : 8
% 0.15/0.66 % Non-unit clause-clause subsumptions : 2
% 0.15/0.66 % Unit Clause-clause subsumption calls : 0
% 0.15/0.66 % Rewrite failures with RHS unbound : 0
% 0.15/0.66 % BW rewrite match attempts : 3
% 0.15/0.66 % BW rewrite match successes : 0
% 0.15/0.66 % Condensation attempts : 0
% 0.15/0.66 % Condensation successes : 0
% 0.15/0.66 % Termbank termtop insertions : 1467
% 0.15/0.66 % Search garbage collected termcells : 351
% 0.15/0.66
% 0.15/0.66 % -------------------------------------------------
% 0.15/0.66 % User time : 0.003 s
% 0.15/0.66 % System time : 0.004 s
% 0.15/0.66 % Total time : 0.007 s
% 0.15/0.66 % Maximum resident set size: 3720 pages
% 0.15/0.66
% 0.15/0.66 % -------------------------------------------------
% 0.15/0.66 % User time : 0.009 s
% 0.15/0.66 % System time : 0.006 s
% 0.15/0.66 % Total time : 0.015 s
% 0.15/0.66 % Maximum resident set size: 4608 pages
% 0.15/0.66 % E exiting
%------------------------------------------------------------------------------