%------------------------------------------------------------------------------
% File : E---3.5.1
% Problem : SET020-7 : 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 : n015.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:08 PM UTC 2026
% Result : Unsatisfiable 8.91s 1.93s
% Output : CNFRefutation 8.91s
% Verified :
% SZS Type : Refutation
% Derivation depth : 8
% Number of leaves : 10
% Syntax : Number of clauses : 36 ( 12 unt; 14 nHn; 20 RR)
% Number of literals : 63 ( 38 equ; 17 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 : 7 ( 7 usr; 3 con; 0-2 aty)
% Number of variables : 57 ( 26 sgn)
% Comments :
%------------------------------------------------------------------------------
cnf(corollary_1_to_cartesian_product,axiom,
( ~ member(ordered_pair(X1,X2),cross_product(X3,X4))
| member(X1,universal_class) ),
file('/export/starexec/sandbox/benchmark/theBenchmark.p',corollary_1_to_cartesian_product) ).
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/sandbox/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/sandbox/benchmark/theBenchmark.p',existence_of_1st_and_2nd_5) ).
cnf(cartesian_product4,axiom,
( ~ member(X1,cross_product(X2,X3))
| ordered_pair(first(X1),second(X1)) = X1 ),
file('/export/starexec/sandbox/benchmark/Axioms/SET004-0.ax',cartesian_product4) ).
cnf(ordered_pair_determines_components1,axiom,
( ~ member(X1,universal_class)
| ordered_pair(X1,X2) != ordered_pair(X3,X4)
| X1 = X3 ),
file('/export/starexec/sandbox/benchmark/theBenchmark.p',ordered_pair_determines_components1) ).
cnf(existence_of_1st_and_2nd_2,axiom,
( first(X1) = X1
| member(ordered_pair(first(X1),second(X1)),cross_product(universal_class,universal_class)) ),
file('/export/starexec/sandbox/benchmark/theBenchmark.p',existence_of_1st_and_2nd_2) ).
cnf(existence_of_1st_and_2nd_4,axiom,
( first(X1) = X1
| ordered_pair(first(X1),second(X1)) = X1 ),
file('/export/starexec/sandbox/benchmark/theBenchmark.p',existence_of_1st_and_2nd_4) ).
cnf(prove_unique_1st_and_2nd_in_pair_of_sets1_1,negated_conjecture,
member(ordered_pair(u,v),cross_product(universal_class,universal_class)),
file('/export/starexec/sandbox/benchmark/theBenchmark.p',prove_unique_1st_and_2nd_in_pair_of_sets1_1) ).
cnf(prove_unique_1st_and_2nd_in_pair_of_sets1_2,negated_conjecture,
first(ordered_pair(u,v)) != u,
file('/export/starexec/sandbox/benchmark/theBenchmark.p',prove_unique_1st_and_2nd_in_pair_of_sets1_2) ).
cnf(ordered_pair_is_set,axiom,
member(ordered_pair(X1,X2),universal_class),
file('/export/starexec/sandbox/benchmark/theBenchmark.p',ordered_pair_is_set) ).
cnf(c_0_10,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_11,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_12,axiom,
( second(X1) = X1
| ordered_pair(first(X1),second(X1)) = X1 ),
existence_of_1st_and_2nd_5 ).
cnf(c_0_13,plain,
( ~ member(X1,cross_product(X2,X3))
| ordered_pair(first(X1),second(X1)) = X1 ),
inference(fof_simplification,[status(thm)],[cartesian_product4]) ).
cnf(c_0_14,plain,
( ~ member(X1,universal_class)
| ordered_pair(X1,X2) != ordered_pair(X3,X4)
| X1 = X3 ),
inference(fof_simplification,[status(thm)],[ordered_pair_determines_components1]) ).
cnf(c_0_15,plain,
( ~ member(ordered_pair(X1,X2),cross_product(X3,X4))
| member(X1,universal_class) ),
c_0_10 ).
cnf(c_0_16,plain,
( member(X1,cross_product(universal_class,universal_class))
| second(X1) = X1 ),
inference(spm,[status(thm)],[c_0_11,c_0_12]) ).
cnf(c_0_17,axiom,
( first(X1) = X1
| member(ordered_pair(first(X1),second(X1)),cross_product(universal_class,universal_class)) ),
existence_of_1st_and_2nd_2 ).
cnf(c_0_18,axiom,
( first(X1) = X1
| ordered_pair(first(X1),second(X1)) = X1 ),
existence_of_1st_and_2nd_4 ).
cnf(c_0_19,plain,
( ~ member(X1,cross_product(X2,X3))
| ordered_pair(first(X1),second(X1)) = X1 ),
c_0_13 ).
cnf(c_0_20,negated_conjecture,
member(ordered_pair(u,v),cross_product(universal_class,universal_class)),
prove_unique_1st_and_2nd_in_pair_of_sets1_1 ).
cnf(c_0_21,plain,
( ~ member(X1,universal_class)
| ordered_pair(X1,X2) != ordered_pair(X3,X4)
| X1 = X3 ),
c_0_14 ).
cnf(c_0_22,plain,
( member(X1,universal_class)
| second(ordered_pair(X1,X2)) = ordered_pair(X1,X2) ),
inference(spm,[status(thm)],[c_0_15,c_0_16]) ).
cnf(c_0_23,negated_conjecture,
first(ordered_pair(u,v)) != u,
inference(fof_simplification,[status(thm)],[prove_unique_1st_and_2nd_in_pair_of_sets1_2]) ).
cnf(c_0_24,plain,
( member(X1,cross_product(universal_class,universal_class))
| first(X1) = X1 ),
inference(spm,[status(thm)],[c_0_17,c_0_18]) ).
cnf(c_0_25,negated_conjecture,
ordered_pair(first(ordered_pair(u,v)),second(ordered_pair(u,v))) = ordered_pair(u,v),
inference(spm,[status(thm)],[c_0_19,c_0_20]) ).
cnf(c_0_26,plain,
( first(ordered_pair(X1,X2)) = X1
| second(ordered_pair(X1,X2)) = ordered_pair(X1,X2) ),
inference(csr,[status(thm)],[inference(er,[status(thm)],[inference(spm,[status(thm)],[c_0_21,c_0_12])]),c_0_22]) ).
cnf(c_0_27,negated_conjecture,
first(ordered_pair(u,v)) != u,
c_0_23 ).
cnf(c_0_28,plain,
( member(X1,universal_class)
| first(ordered_pair(X1,X2)) = ordered_pair(X1,X2) ),
inference(spm,[status(thm)],[c_0_15,c_0_24]) ).
cnf(c_0_29,negated_conjecture,
ordered_pair(first(ordered_pair(u,v)),ordered_pair(u,v)) = ordered_pair(u,v),
inference(sr,[status(thm)],[inference(spm,[status(thm)],[c_0_25,c_0_26]),c_0_27]) ).
cnf(c_0_30,plain,
( first(ordered_pair(X1,X2)) = X1
| first(ordered_pair(X1,X2)) = ordered_pair(X1,X2) ),
inference(csr,[status(thm)],[inference(er,[status(thm)],[inference(spm,[status(thm)],[c_0_21,c_0_18])]),c_0_28]) ).
cnf(c_0_31,negated_conjecture,
ordered_pair(ordered_pair(u,v),ordered_pair(u,v)) = ordered_pair(u,v),
inference(sr,[status(thm)],[inference(spm,[status(thm)],[c_0_29,c_0_30]),c_0_27]) ).
cnf(c_0_32,axiom,
member(ordered_pair(X1,X2),universal_class),
ordered_pair_is_set ).
cnf(c_0_33,negated_conjecture,
( ordered_pair(u,v) != ordered_pair(X1,X2)
| ordered_pair(u,v) = X1 ),
inference(cn,[status(thm)],[inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_21,c_0_31]),c_0_32])]) ).
cnf(c_0_34,negated_conjecture,
ordered_pair(u,v) != u,
inference(sr,[status(thm)],[inference(spm,[status(thm)],[c_0_27,c_0_30]),c_0_27]) ).
cnf(c_0_35,negated_conjecture,
$false,
inference(sr,[status(thm)],[inference(er,[status(thm)],[c_0_33]),c_0_34]),
[proof] ).
%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.00/0.02 % Problem : SET020-7 : TPTP v9.3.1. Bugfixed v2.1.0.
% 0.00/0.04 % Command : run_E /export/starexec/sandbox/benchmark/theBenchmark.p 300 THM
% 0.09/0.37 % Computer : n015.cluster.edu
% 0.09/0.37 % Model : x86_64 x86_64
% 0.09/0.37 % CPU : Intel(R) Xeon(R) CPU E5-2620 v4 @ 2.10GHz
% 0.09/0.37 % Memory : 8046.5625MB
% 0.09/0.37 % OS : Linux 6.8.0-71-generic
% 0.09/0.37 % CPULimit : 300
% 0.09/0.37 % WCLimit : 300
% 0.09/0.37 % DateTime : Mon Sep 21 04:46:35 UTC 2026
% 0.09/0.37 % CPUTime :
% 0.09/0.37 Running run_E /export/starexec/sandbox/benchmark/theBenchmark.p 300 THM
% 0.14/0.42 Running first-order theorem proving
% 0.14/0.42 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
% 8.91/1.93 % Version: 3.5.1
% 8.91/1.93 % Preprocessing class: FSLSSMSMSSSNFFN.
% 8.91/1.93 % Scheduled 4 strats onto 8 cores with 300 seconds (2400 total)
% 8.91/1.93 % Starting C07_19_nc_SOS_SAT001_MinMin_p005000_rr with 1500s (5) cores
% 8.91/1.93 % Starting new_bool_3 with 300s (1) cores
% 8.91/1.93 % Starting new_bool_1 with 300s (1) cores
% 8.91/1.93 % Starting sh5l with 300s (1) cores
% 8.91/1.93 % new_bool_3 with pid 587340 completed with status 0
% 8.91/1.93 % Result found by new_bool_3
% 8.91/1.93 % Preprocessing class: FSLSSMSMSSSNFFN.
% 8.91/1.93 % Scheduled 4 strats onto 8 cores with 300 seconds (2400 total)
% 8.91/1.93 % Starting C07_19_nc_SOS_SAT001_MinMin_p005000_rr with 1500s (5) cores
% 8.91/1.93 % Starting new_bool_3 with 300s (1) cores
% 8.91/1.93 % (lift_lambdas = 0, lambda_to_forall = 0,unroll_only_formulas = 0, sine = GSinE(CountFormulas,hypos,1.5,,3,20000,1.0))
% 8.91/1.93 % SinE strategy is GSinE(CountFormulas,hypos,1.5,,3,20000,1.0)
% 8.91/1.93 % Search class: FGHSM-FFMS21-MFFFFFNN
% 8.91/1.93 % Scheduled 5 strats onto 1 cores with 300 seconds (300 total)
% 8.91/1.93 % Starting SubtermCWHack with 31s (1) cores
% 8.91/1.93 % SubtermCWHack with pid 587344 completed with status 0
% 8.91/1.93 % Result found by SubtermCWHack
% 8.91/1.93 % Preprocessing class: FSLSSMSMSSSNFFN.
% 8.91/1.93 % Scheduled 4 strats onto 8 cores with 300 seconds (2400 total)
% 8.91/1.93 % Starting C07_19_nc_SOS_SAT001_MinMin_p005000_rr with 1500s (5) cores
% 8.91/1.93 % Starting new_bool_3 with 300s (1) cores
% 8.91/1.93 % (lift_lambdas = 0, lambda_to_forall = 0,unroll_only_formulas = 0, sine = GSinE(CountFormulas,hypos,1.5,,3,20000,1.0))
% 8.91/1.93 % SinE strategy is GSinE(CountFormulas,hypos,1.5,,3,20000,1.0)
% 8.91/1.93 % Search class: FGHSM-FFMS21-MFFFFFNN
% 8.91/1.93 % Scheduled 5 strats onto 1 cores with 300 seconds (300 total)
% 8.91/1.93 % Starting SubtermCWHack with 31s (1) cores
% 8.91/1.93 % Preprocessing time : 0.002 s
% 8.91/1.93
% 8.91/1.93 % Proof found!
% 8.91/1.93 % SZS status Unsatisfiable
% 8.91/1.93 % SZS output start CNFRefutation
% See solution above
% 8.91/1.93 % Parsed axioms : 159
% 8.91/1.93 % Removed by relevancy pruning/SinE : 95
% 8.91/1.93 % Initial clauses : 64
% 8.91/1.93 % Removed in clause preprocessing : 0
% 8.91/1.93 % Initial clauses in saturation : 64
% 8.91/1.93 % Processed clauses : 7648
% 8.91/1.93 % ...of these trivial : 413
% 8.91/1.93 % ...subsumed : 6202
% 8.91/1.93 % ...remaining for further processing : 1033
% 8.91/1.93 % Other redundant clauses eliminated : 256
% 8.91/1.93 % Clauses deleted for lack of memory : 0
% 8.91/1.93 % Backward-subsumed : 76
% 8.91/1.93 % Backward-rewritten : 59
% 8.91/1.93 % Generated clauses : 100758
% 8.91/1.93 % ...of the previous two non-redundant : 59934
% 8.91/1.93 % ...aggressively subsumed : 0
% 8.91/1.93 % Contextual simplify-reflections : 15
% 8.91/1.93 % Paramodulations : 100481
% 8.91/1.93 % Factorizations : 6
% 8.91/1.93 % NegExts : 0
% 8.91/1.93 % Equation resolutions : 271
% 8.91/1.93 % Disequality decompositions : 0
% 8.91/1.93 % Total rewrite steps : 58547
% 8.91/1.93 % ...of those cached : 56622
% 8.91/1.93 % Propositional unsat checks : 0
% 8.91/1.93 % Propositional check models : 0
% 8.91/1.93 % Propositional check unsatisfiable : 0
% 8.91/1.93 % Propositional clauses : 0
% 8.91/1.93 % Propositional clauses after purity: 0
% 8.91/1.93 % Propositional unsat core size : 0
% 8.91/1.93 % Propositional preprocessing time : 0.000
% 8.91/1.93 % Propositional encoding time : 0.000
% 8.91/1.93 % Propositional solver time : 0.000
% 8.91/1.93 % Success case prop preproc time : 0.000
% 8.91/1.93 % Success case prop encoding time : 0.000
% 8.91/1.93 % Success case prop solver time : 0.000
% 8.91/1.93 % Current number of processed clauses : 896
% 8.91/1.93 % Positive orientable unit clauses : 145
% 8.91/1.93 % Positive unorientable unit clauses: 4
% 8.91/1.93 % Negative unit clauses : 13
% 8.91/1.93 % Non-unit-clauses : 734
% 8.91/1.93 % Current number of unprocessed clauses: 51569
% 8.91/1.93 % ...number of literals in the above : 169627
% 8.91/1.93 % Current number of archived formulas : 0
% 8.91/1.93 % Current number of archived clauses : 135
% 8.91/1.93 % Clause-clause subsumption calls (NU) : 79689
% 8.91/1.93 % Rec. Clause-clause subsumption calls : 67326
% 8.91/1.93 % Non-unit clause-clause subsumptions : 5270
% 8.91/1.93 % Unit Clause-clause subsumption calls : 691
% 8.91/1.93 % Rewrite failures with RHS unbound : 0
% 8.91/1.93 % BW rewrite match attempts : 160
% 8.91/1.93 % BW rewrite match successes : 69
% 8.91/1.93 % Condensation attempts : 0
% 8.91/1.93 % Condensation successes : 0
% 8.91/1.93 % Termbank termtop insertions : 1228233
% 8.91/1.93 % Search garbage collected termcells : 517
% 8.91/1.93
% 8.91/1.93 % -------------------------------------------------
% 8.91/1.93 % User time : 0.913 s
% 8.91/1.93 % System time : 0.035 s
% 8.91/1.93 % Total time : 0.947 s
% 8.91/1.93 % Maximum resident set size: 3704 pages
% 8.91/1.93
% 8.91/1.93 % -------------------------------------------------
% 8.91/1.93 % User time : 0.916 s
% 8.91/1.93 % System time : 0.041 s
% 8.91/1.93 % Total time : 0.957 s
% 8.91/1.93 % Maximum resident set size: 4864 pages
% 8.91/1.93 % E exiting
%------------------------------------------------------------------------------