%------------------------------------------------------------------------------
% File : E-SAT---3.5.1
% Problem : SET108-7 : 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 : n003.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:34 PM UTC 2026
% Result : Unsatisfiable 3.98s 1.13s
% Output : CNFRefutation 3.98s
% Verified :
% SZS Type : Refutation
% Derivation depth : 4
% Number of leaves : 3
% Syntax : Number of clauses : 10 ( 7 unt; 0 nHn; 10 RR)
% Number of literals : 13 ( 4 equ; 6 neg)
% Maximal clause size : 2 ( 1 avg)
% Maximal term depth : 4 ( 2 avg)
% Number of predicates : 3 ( 1 usr; 1 prp; 0-2 aty)
% Number of functors : 7 ( 7 usr; 3 con; 0-2 aty)
% Number of variables : 9 ( 6 sgn)
% Comments :
%------------------------------------------------------------------------------
cnf(cartesian_product4,axiom,
( ~ member(X1,cross_product(X2,X3))
| ordered_pair(first(X1),second(X1)) = X1 ),
file('/export/starexec/sandbox2/benchmark/Axioms/SET004-0.ax',cartesian_product4) ).
cnf(prove_existence_of_1st_and_2nd_1_2,negated_conjecture,
~ member(ordered_pair(first(ordered_pair(y,z)),second(ordered_pair(y,z))),cross_product(universal_class,universal_class)),
file('/export/starexec/sandbox2/benchmark/theBenchmark.p',prove_existence_of_1st_and_2nd_1_2) ).
cnf(prove_existence_of_1st_and_2nd_1_1,negated_conjecture,
member(ordered_pair(y,z),cross_product(universal_class,universal_class)),
file('/export/starexec/sandbox2/benchmark/theBenchmark.p',prove_existence_of_1st_and_2nd_1_1) ).
cnf(c_0_3,plain,
( ~ member(X1,cross_product(X2,X3))
| ordered_pair(first(X1),second(X1)) = X1 ),
inference(fof_simplification,[status(thm)],[cartesian_product4]) ).
cnf(c_0_4,negated_conjecture,
~ member(ordered_pair(first(ordered_pair(y,z)),second(ordered_pair(y,z))),cross_product(universal_class,universal_class)),
inference(fof_simplification,[status(thm)],[prove_existence_of_1st_and_2nd_1_2]) ).
cnf(c_0_5,plain,
( ~ member(X1,cross_product(X2,X3))
| ordered_pair(first(X1),second(X1)) = X1 ),
c_0_3 ).
cnf(c_0_6,negated_conjecture,
member(ordered_pair(y,z),cross_product(universal_class,universal_class)),
prove_existence_of_1st_and_2nd_1_1 ).
cnf(c_0_7,negated_conjecture,
~ member(ordered_pair(first(ordered_pair(y,z)),second(ordered_pair(y,z))),cross_product(universal_class,universal_class)),
c_0_4 ).
cnf(c_0_8,negated_conjecture,
ordered_pair(first(ordered_pair(y,z)),second(ordered_pair(y,z))) = ordered_pair(y,z),
inference(spm,[status(thm)],[c_0_5,c_0_6]) ).
cnf(c_0_9,negated_conjecture,
$false,
inference(cn,[status(thm)],[inference(rw,[status(thm)],[inference(rw,[status(thm)],[c_0_7,c_0_8]),c_0_6])]),
[proof] ).
%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.00/0.03 % Problem : SET108-7 : 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.37 % Computer : n003.cluster.edu
% 0.11/0.37 % Model : x86_64 x86_64
% 0.11/0.37 % CPU : Intel(R) Xeon(R) CPU E5-2620 v4 @ 2.10GHz
% 0.11/0.37 % Memory : 8046.5625MB
% 0.11/0.37 % OS : Linux 6.8.0-71-generic
% 0.11/0.37 % CPULimit : 300
% 0.11/0.37 % WCLimit : 300
% 0.11/0.37 % DateTime : Mon Sep 21 04:55:15 UTC 2026
% 0.14/0.37 % CPUTime :
% 0.14/0.37 Running run_E /export/starexec/sandbox2/benchmark/theBenchmark.p 300 THM
% 0.14/0.44 Running first-order theorem proving
% 0.14/0.44 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
% 3.98/1.13 % Version: 3.5.1
% 3.98/1.13 % Preprocessing class: FSLSSMSMSSSNFFN.
% 3.98/1.13 % Scheduled 4 strats onto 8 cores with 300 seconds (2400 total)
% 3.98/1.13 % Starting C07_19_nc_SOS_SAT001_MinMin_p005000_rr with 1500s (5) cores
% 3.98/1.13 % Starting new_bool_3 with 300s (1) cores
% 3.98/1.13 % Starting new_bool_1 with 300s (1) cores
% 3.98/1.13 % Starting sh5l with 300s (1) cores
% 3.98/1.13 % new_bool_3 with pid 3452944 completed with status 0
% 3.98/1.13 % Result found by new_bool_3
% 3.98/1.13 % Preprocessing class: FSLSSMSMSSSNFFN.
% 3.98/1.13 % Scheduled 4 strats onto 8 cores with 300 seconds (2400 total)
% 3.98/1.13 % Starting C07_19_nc_SOS_SAT001_MinMin_p005000_rr with 1500s (5) cores
% 3.98/1.13 % Starting new_bool_3 with 300s (1) cores
% 3.98/1.13 % (lift_lambdas = 0, lambda_to_forall = 0,unroll_only_formulas = 0, sine = GSinE(CountFormulas,hypos,1.5,,3,20000,1.0))
% 3.98/1.13 % SinE strategy is GSinE(CountFormulas,hypos,1.5,,3,20000,1.0)
% 3.98/1.13 % Search class: FGHSM-FFMS21-MFFFFFNN
% 3.98/1.13 % Scheduled 5 strats onto 1 cores with 300 seconds (300 total)
% 3.98/1.13 % Starting SubtermCWHack with 31s (1) cores
% 3.98/1.13 % SubtermCWHack with pid 3452946 completed with status 0
% 3.98/1.13 % Result found by SubtermCWHack
% 3.98/1.13 % Preprocessing class: FSLSSMSMSSSNFFN.
% 3.98/1.13 % Scheduled 4 strats onto 8 cores with 300 seconds (2400 total)
% 3.98/1.13 % Starting C07_19_nc_SOS_SAT001_MinMin_p005000_rr with 1500s (5) cores
% 3.98/1.13 % Starting new_bool_3 with 300s (1) cores
% 3.98/1.13 % (lift_lambdas = 0, lambda_to_forall = 0,unroll_only_formulas = 0, sine = GSinE(CountFormulas,hypos,1.5,,3,20000,1.0))
% 3.98/1.13 % SinE strategy is GSinE(CountFormulas,hypos,1.5,,3,20000,1.0)
% 3.98/1.13 % Search class: FGHSM-FFMS21-MFFFFFNN
% 3.98/1.13 % Scheduled 5 strats onto 1 cores with 300 seconds (300 total)
% 3.98/1.13 % Starting SubtermCWHack with 31s (1) cores
% 3.98/1.13 % Preprocessing time : 0.003 s
% 3.98/1.13
% 3.98/1.13 % Proof found!
% 3.98/1.13 % SZS status Unsatisfiable
% 3.98/1.13 % SZS output start CNFRefutation
% See solution above
% 3.98/1.13 % Parsed axioms : 154
% 3.98/1.13 % Removed by relevancy pruning/SinE : 95
% 3.98/1.13 % Initial clauses : 59
% 3.98/1.13 % Removed in clause preprocessing : 0
% 3.98/1.13 % Initial clauses in saturation : 59
% 3.98/1.13 % Processed clauses : 2541
% 3.98/1.13 % ...of these trivial : 174
% 3.98/1.13 % ...subsumed : 1844
% 3.98/1.13 % ...remaining for further processing : 523
% 3.98/1.13 % Other redundant clauses eliminated : 2
% 3.98/1.13 % Clauses deleted for lack of memory : 0
% 3.98/1.13 % Backward-subsumed : 47
% 3.98/1.13 % Backward-rewritten : 47
% 3.98/1.13 % Generated clauses : 29807
% 3.98/1.13 % ...of the previous two non-redundant : 16825
% 3.98/1.13 % ...aggressively subsumed : 0
% 3.98/1.13 % Contextual simplify-reflections : 6
% 3.98/1.13 % Paramodulations : 29799
% 3.98/1.13 % Factorizations : 0
% 3.98/1.13 % NegExts : 0
% 3.98/1.13 % Equation resolutions : 8
% 3.98/1.13 % Disequality decompositions : 0
% 3.98/1.13 % Total rewrite steps : 16467
% 3.98/1.13 % ...of those cached : 15418
% 3.98/1.13 % Propositional unsat checks : 0
% 3.98/1.13 % Propositional check models : 0
% 3.98/1.13 % Propositional check unsatisfiable : 0
% 3.98/1.13 % Propositional clauses : 0
% 3.98/1.13 % Propositional clauses after purity: 0
% 3.98/1.13 % Propositional unsat core size : 0
% 3.98/1.13 % Propositional preprocessing time : 0.000
% 3.98/1.13 % Propositional encoding time : 0.000
% 3.98/1.13 % Propositional solver time : 0.000
% 3.98/1.13 % Success case prop preproc time : 0.000
% 3.98/1.13 % Success case prop encoding time : 0.000
% 3.98/1.13 % Success case prop solver time : 0.000
% 3.98/1.13 % Current number of processed clauses : 427
% 3.98/1.13 % Positive orientable unit clauses : 90
% 3.98/1.13 % Positive unorientable unit clauses: 4
% 3.98/1.13 % Negative unit clauses : 12
% 3.98/1.13 % Non-unit-clauses : 321
% 3.98/1.13 % Current number of unprocessed clauses: 13993
% 3.98/1.13 % ...number of literals in the above : 45066
% 3.98/1.13 % Current number of archived formulas : 0
% 3.98/1.13 % Current number of archived clauses : 94
% 3.98/1.13 % Clause-clause subsumption calls (NU) : 23049
% 3.98/1.13 % Rec. Clause-clause subsumption calls : 15959
% 3.98/1.13 % Non-unit clause-clause subsumptions : 1362
% 3.98/1.13 % Unit Clause-clause subsumption calls : 1455
% 3.98/1.13 % Rewrite failures with RHS unbound : 0
% 3.98/1.13 % BW rewrite match attempts : 126
% 3.98/1.13 % BW rewrite match successes : 65
% 3.98/1.13 % Condensation attempts : 0
% 3.98/1.13 % Condensation successes : 0
% 3.98/1.13 % Termbank termtop insertions : 327027
% 3.98/1.13 % Search garbage collected termcells : 516
% 3.98/1.13
% 3.98/1.13 % -------------------------------------------------
% 3.98/1.13 % User time : 0.503 s
% 3.98/1.13 % System time : 0.027 s
% 3.98/1.13 % Total time : 0.530 s
% 3.98/1.13 % Maximum resident set size: 3756 pages
% 3.98/1.13
% 3.98/1.13 % -------------------------------------------------
% 3.98/1.13 % User time : 0.508 s
% 3.98/1.13 % System time : 0.030 s
% 3.98/1.13 % Total time : 0.538 s
% 3.98/1.13 % Maximum resident set size: 4608 pages
% 3.98/1.13 % E exiting
%------------------------------------------------------------------------------