%------------------------------------------------------------------------------
% File : E---3.5.1
% Problem : SET120-7 : TPTP v9.3.1. Bugfixed v7.3.0.
% Transfm : none
% Format : tptp:raw
% Command : run_E /export/starexec/sandbox2/benchmark/theBenchmark.p 300 THM
% Computer : n002.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:13:40 PM UTC 2026
% Result : Unsatisfiable 0.22s 0.59s
% Output : CNFRefutation 0.22s
% Verified :
% SZS Type : Refutation
% Derivation depth : 4
% Number of leaves : 5
% Syntax : Number of clauses : 16 ( 8 unt; 5 nHn; 11 RR)
% Number of literals : 24 ( 10 equ; 9 neg)
% Maximal clause size : 2 ( 1 avg)
% Maximal term depth : 3 ( 1 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 : 17 ( 9 sgn)
% Comments :
%------------------------------------------------------------------------------
cnf(prove_corollary_2_to_OP_determines_components1_2,negated_conjecture,
second(ordered_pair(x,y)) != ordered_pair(x,y),
file('/export/starexec/sandbox2/benchmark/theBenchmark.p',prove_corollary_2_to_OP_determines_components1_2) ).
cnf(existence_of_1st_and_2nd_3,axiom,
( second(X1) = X1
| member(ordered_pair(first(X1),second(X1)),cross_product(universal_class,universal_class)) ),
file('/export/starexec/sandbox2/benchmark/theBenchmark.p',existence_of_1st_and_2nd_3) ).
cnf(existence_of_1st_and_2nd_5,axiom,
( second(X1) = X1
| ordered_pair(first(X1),second(X1)) = X1 ),
file('/export/starexec/sandbox2/benchmark/theBenchmark.p',existence_of_1st_and_2nd_5) ).
cnf(corollary_1_to_cartesian_product,axiom,
( ~ member(ordered_pair(X1,X2),cross_product(X3,X4))
| member(X1,universal_class) ),
file('/export/starexec/sandbox2/benchmark/theBenchmark.p',corollary_1_to_cartesian_product) ).
cnf(prove_corollary_2_to_OP_determines_components1_1,negated_conjecture,
~ member(x,universal_class),
file('/export/starexec/sandbox2/benchmark/theBenchmark.p',prove_corollary_2_to_OP_determines_components1_1) ).
cnf(c_0_5,negated_conjecture,
second(ordered_pair(x,y)) != ordered_pair(x,y),
inference(fof_simplification,[status(thm)],[prove_corollary_2_to_OP_determines_components1_2]) ).
cnf(c_0_6,axiom,
( second(X1) = X1
| member(ordered_pair(first(X1),second(X1)),cross_product(universal_class,universal_class)) ),
existence_of_1st_and_2nd_3 ).
cnf(c_0_7,axiom,
( second(X1) = X1
| ordered_pair(first(X1),second(X1)) = X1 ),
existence_of_1st_and_2nd_5 ).
cnf(c_0_8,plain,
( ~ member(ordered_pair(X1,X2),cross_product(X3,X4))
| member(X1,universal_class) ),
inference(fof_simplification,[status(thm)],[corollary_1_to_cartesian_product]) ).
cnf(c_0_9,negated_conjecture,
second(ordered_pair(x,y)) != ordered_pair(x,y),
c_0_5 ).
cnf(c_0_10,plain,
( member(X1,cross_product(universal_class,universal_class))
| second(X1) = X1 ),
inference(spm,[status(thm)],[c_0_6,c_0_7]) ).
cnf(c_0_11,negated_conjecture,
~ member(x,universal_class),
inference(fof_simplification,[status(thm)],[prove_corollary_2_to_OP_determines_components1_1]) ).
cnf(c_0_12,plain,
( ~ member(ordered_pair(X1,X2),cross_product(X3,X4))
| member(X1,universal_class) ),
c_0_8 ).
cnf(c_0_13,negated_conjecture,
member(ordered_pair(x,y),cross_product(universal_class,universal_class)),
inference(spm,[status(thm)],[c_0_9,c_0_10]) ).
cnf(c_0_14,negated_conjecture,
~ member(x,universal_class),
c_0_11 ).
cnf(c_0_15,negated_conjecture,
$false,
inference(sr,[status(thm)],[inference(spm,[status(thm)],[c_0_12,c_0_13]),c_0_14]),
[proof] ).
%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.00/0.03 % Problem : SET120-7 : TPTP v9.3.1. Bugfixed v7.3.0.
% 0.00/0.05 % Command : run_E /export/starexec/sandbox2/benchmark/theBenchmark.p 300 THM
% 0.11/0.36 % Computer : n002.cluster.edu
% 0.11/0.36 % Model : x86_64 x86_64
% 0.11/0.36 % CPU : Intel(R) Xeon(R) CPU E5-2620 v4 @ 2.10GHz
% 0.11/0.36 % Memory : 8046.5625MB
% 0.11/0.36 % OS : Linux 6.8.0-71-generic
% 0.11/0.36 % CPULimit : 300
% 0.11/0.37 % WCLimit : 300
% 0.11/0.37 % DateTime : Mon Sep 21 04:57:47 UTC 2026
% 0.11/0.37 % CPUTime :
% 0.11/0.37 Running run_E /export/starexec/sandbox2/benchmark/theBenchmark.p 300 THM
% 0.15/0.46 Running first-order theorem proving
% 0.15/0.46 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.22/0.59 % Version: 3.5.1
% 0.22/0.59 % Preprocessing class: FSLSSMSMSSSNFFN.
% 0.22/0.59 % Scheduled 4 strats onto 8 cores with 300 seconds (2400 total)
% 0.22/0.59 % Starting C07_19_nc_SOS_SAT001_MinMin_p005000_rr with 1500s (5) cores
% 0.22/0.59 % Starting new_bool_3 with 300s (1) cores
% 0.22/0.59 % Starting new_bool_1 with 300s (1) cores
% 0.22/0.59 % Starting sh5l with 300s (1) cores
% 0.22/0.59 % sh5l with pid 2477222 completed with status 0
% 0.22/0.59 % Result found by sh5l
% 0.22/0.59 % Preprocessing class: FSLSSMSMSSSNFFN.
% 0.22/0.59 % Scheduled 4 strats onto 8 cores with 300 seconds (2400 total)
% 0.22/0.59 % Starting C07_19_nc_SOS_SAT001_MinMin_p005000_rr with 1500s (5) cores
% 0.22/0.59 % Starting new_bool_3 with 300s (1) cores
% 0.22/0.59 % Starting new_bool_1 with 300s (1) cores
% 0.22/0.59 % Starting sh5l with 300s (1) cores
% 0.22/0.59 % (lift_lambdas = 0, lambda_to_forall = 0,unroll_only_formulas = 0, sine = gf500_gu_R04_F100_L20000)
% 0.22/0.59 % SinE strategy is gf500_gu_R04_F100_L20000
% 0.22/0.59 % Search class: FGHSM-FFLM31-MFFFFFNN
% 0.22/0.59 % Scheduled 9 strats onto 1 cores with 300 seconds (300 total)
% 0.22/0.59 % Starting SubtermCWHack with 28s (1) cores
% 0.22/0.59 % SubtermCWHack with pid 2477225 completed with status 0
% 0.22/0.59 % Result found by SubtermCWHack
% 0.22/0.59 % Preprocessing class: FSLSSMSMSSSNFFN.
% 0.22/0.59 % Scheduled 4 strats onto 8 cores with 300 seconds (2400 total)
% 0.22/0.59 % Starting C07_19_nc_SOS_SAT001_MinMin_p005000_rr with 1500s (5) cores
% 0.22/0.59 % Starting new_bool_3 with 300s (1) cores
% 0.22/0.59 % Starting new_bool_1 with 300s (1) cores
% 0.22/0.59 % Starting sh5l with 300s (1) cores
% 0.22/0.59 % (lift_lambdas = 0, lambda_to_forall = 0,unroll_only_formulas = 0, sine = gf500_gu_R04_F100_L20000)
% 0.22/0.59 % SinE strategy is gf500_gu_R04_F100_L20000
% 0.22/0.59 % Search class: FGHSM-FFLM31-MFFFFFNN
% 0.22/0.59 % Scheduled 9 strats onto 1 cores with 300 seconds (300 total)
% 0.22/0.59 % Starting SubtermCWHack with 28s (1) cores
% 0.22/0.59 % Preprocessing time : 0.005 s
% 0.22/0.59
% 0.22/0.59 % Proof found!
% 0.22/0.59 % SZS status Unsatisfiable
% 0.22/0.59 % SZS output start CNFRefutation
% See solution above
% 0.22/0.59 % Parsed axioms : 167
% 0.22/0.59 % Removed by relevancy pruning/SinE : 11
% 0.22/0.59 % Initial clauses : 156
% 0.22/0.59 % Removed in clause preprocessing : 0
% 0.22/0.59 % Initial clauses in saturation : 156
% 0.22/0.59 % Processed clauses : 450
% 0.22/0.59 % ...of these trivial : 7
% 0.22/0.59 % ...subsumed : 179
% 0.22/0.59 % ...remaining for further processing : 264
% 0.22/0.59 % Other redundant clauses eliminated : 29
% 0.22/0.59 % Clauses deleted for lack of memory : 0
% 0.22/0.59 % Backward-subsumed : 5
% 0.22/0.59 % Backward-rewritten : 5
% 0.22/0.59 % Generated clauses : 1703
% 0.22/0.59 % ...of the previous two non-redundant : 1206
% 0.22/0.59 % ...aggressively subsumed : 0
% 0.22/0.59 % Contextual simplify-reflections : 3
% 0.22/0.59 % Paramodulations : 1665
% 0.22/0.59 % Factorizations : 6
% 0.22/0.59 % NegExts : 0
% 0.22/0.59 % Equation resolutions : 32
% 0.22/0.59 % Disequality decompositions : 0
% 0.22/0.59 % Total rewrite steps : 544
% 0.22/0.59 % ...of those cached : 412
% 0.22/0.59 % Propositional unsat checks : 0
% 0.22/0.59 % Propositional check models : 0
% 0.22/0.59 % Propositional check unsatisfiable : 0
% 0.22/0.59 % Propositional clauses : 0
% 0.22/0.59 % Propositional clauses after purity: 0
% 0.22/0.59 % Propositional unsat core size : 0
% 0.22/0.59 % Propositional preprocessing time : 0.000
% 0.22/0.59 % Propositional encoding time : 0.000
% 0.22/0.59 % Propositional solver time : 0.000
% 0.22/0.59 % Success case prop preproc time : 0.000
% 0.22/0.59 % Success case prop encoding time : 0.000
% 0.22/0.59 % Success case prop solver time : 0.000
% 0.22/0.59 % Current number of processed clauses : 252
% 0.22/0.59 % Positive orientable unit clauses : 68
% 0.22/0.59 % Positive unorientable unit clauses: 4
% 0.22/0.59 % Negative unit clauses : 13
% 0.22/0.59 % Non-unit-clauses : 167
% 0.22/0.60 % Current number of unprocessed clauses: 899
% 0.22/0.60 % ...number of literals in the above : 2343
% 0.22/0.60 % Current number of archived formulas : 0
% 0.22/0.60 % Current number of archived clauses : 10
% 0.22/0.60 % Clause-clause subsumption calls (NU) : 4741
% 0.22/0.60 % Rec. Clause-clause subsumption calls : 4284
% 0.22/0.60 % Non-unit clause-clause subsumptions : 151
% 0.22/0.60 % Unit Clause-clause subsumption calls : 694
% 0.22/0.60 % Rewrite failures with RHS unbound : 0
% 0.22/0.60 % BW rewrite match attempts : 35
% 0.22/0.60 % BW rewrite match successes : 15
% 0.22/0.60 % Condensation attempts : 0
% 0.22/0.60 % Condensation successes : 0
% 0.22/0.60 % Termbank termtop insertions : 19528
% 0.22/0.60 % Search garbage collected termcells : 288
% 0.22/0.60
% 0.22/0.60 % -------------------------------------------------
% 0.22/0.60 % User time : 0.053 s
% 0.22/0.60 % System time : 0.013 s
% 0.22/0.60 % Total time : 0.066 s
% 0.22/0.60 % Maximum resident set size: 3760 pages
% 0.22/0.60
% 0.22/0.60 % -------------------------------------------------
% 0.22/0.60 % User time : 0.062 s
% 0.22/0.60 % System time : 0.018 s
% 0.22/0.60 % Total time : 0.080 s
% 0.22/0.60 % Maximum resident set size: 4608 pages
% 0.22/0.60 % E exiting
%------------------------------------------------------------------------------