%------------------------------------------------------------------------------
% File : E---3.5.1
% Problem : SET020+1 : TPTP v9.3.1. Bugfixed v5.4.0.
% Transfm : none
% Format : tptp:raw
% Command : run_E /export/starexec/sandbox2/benchmark/theBenchmark.p 300 THM
% Computer : n012.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 : Theorem 0.07s 0.36s
% Output : CNFRefutation 0.07s
% Verified :
% SZS Type : Refutation
% Derivation depth : 6
% Number of leaves : 2
% Syntax : Number of formulae : 14 ( 6 unt; 0 def)
% Number of atoms : 39 ( 20 equ)
% Maximal formula atoms : 6 ( 2 avg)
% Number of connectives : 39 ( 14 ~; 10 |; 12 &)
% ( 0 <=>; 3 =>; 0 <=; 0 <~>)
% Maximal formula depth : 8 ( 4 avg)
% Maximal term depth : 3 ( 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 : 14 ( 0 sgn 10 !; 0 ?)
% Comments :
%------------------------------------------------------------------------------
fof(unique_1st_and_2nd_in_pair_of_sets1,conjecture,
! [X3,X4,X1] :
( ( X1 = ordered_pair(X3,X4)
& member(X4,universal_class)
& member(X3,universal_class) )
=> ( second(X1) = X4
& first(X1) = X3 ) ),
file('/export/starexec/sandbox2/benchmark/theBenchmark.p',unique_1st_and_2nd_in_pair_of_sets1) ).
fof(first_second,axiom,
! [X1,X2] :
( ( member(X2,universal_class)
& member(X1,universal_class) )
=> ( second(ordered_pair(X1,X2)) = X2
& first(ordered_pair(X1,X2)) = X1 ) ),
file('/export/starexec/sandbox2/benchmark/Axioms/SET005+0.ax',first_second) ).
fof(c_0_2,negated_conjecture,
~ ! [X3,X4,X1] :
( ( X1 = ordered_pair(X3,X4)
& member(X4,universal_class)
& member(X3,universal_class) )
=> ( second(X1) = X4
& first(X1) = X3 ) ),
inference(assume_negation,[status(cth)],[unique_1st_and_2nd_in_pair_of_sets1]) ).
fof(c_0_3,plain,
! [X13,X14] :
( ( ~ member(X14,universal_class)
| ~ member(X13,universal_class)
| second(ordered_pair(X13,X14)) = X14 )
& ( ~ member(X14,universal_class)
| ~ member(X13,universal_class)
| first(ordered_pair(X13,X14)) = X13 ) ),
inference(distribute,[status(thm)],[inference(fof_nnf,[status(thm)],[inference(variable_rename,[status(thm)],[inference(fof_nnf,[status(thm)],[first_second])])])]) ).
fof(c_0_4,negated_conjecture,
( ( second(esk3_0) != esk2_0
| first(esk3_0) != esk1_0 )
& esk3_0 = ordered_pair(esk1_0,esk2_0)
& member(esk2_0,universal_class)
& member(esk1_0,universal_class) ),
inference(fof_nnf,[status(thm)],[inference(skolemize,[status(esa)],[inference(variable_rename,[status(thm)],[inference(fof_nnf,[status(thm)],[c_0_2])])])]) ).
cnf(c_0_5,plain,
( ~ member(X2,universal_class)
| ~ member(X1,universal_class)
| first(ordered_pair(X1,X2)) = X1 ),
inference(split_conjunct,[status(thm)],[c_0_3]) ).
cnf(c_0_6,negated_conjecture,
esk3_0 = ordered_pair(esk1_0,esk2_0),
inference(split_conjunct,[status(thm)],[c_0_4]) ).
cnf(c_0_7,negated_conjecture,
member(esk2_0,universal_class),
inference(split_conjunct,[status(thm)],[c_0_4]) ).
cnf(c_0_8,negated_conjecture,
member(esk1_0,universal_class),
inference(split_conjunct,[status(thm)],[c_0_4]) ).
cnf(c_0_9,negated_conjecture,
( second(esk3_0) != esk2_0
| first(esk3_0) != esk1_0 ),
inference(split_conjunct,[status(thm)],[c_0_4]) ).
cnf(c_0_10,negated_conjecture,
first(esk3_0) = esk1_0,
inference(cn,[status(thm)],[inference(rw,[status(thm)],[inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_5,c_0_6]),c_0_7]),c_0_8])]) ).
cnf(c_0_11,plain,
( ~ member(X2,universal_class)
| ~ member(X1,universal_class)
| second(ordered_pair(X1,X2)) = X2 ),
inference(split_conjunct,[status(thm)],[c_0_3]) ).
cnf(c_0_12,negated_conjecture,
second(esk3_0) != esk2_0,
inference(cn,[status(thm)],[inference(rw,[status(thm)],[c_0_9,c_0_10])]) ).
cnf(c_0_13,negated_conjecture,
$false,
inference(sr,[status(thm)],[inference(cn,[status(thm)],[inference(rw,[status(thm)],[inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_11,c_0_6]),c_0_7]),c_0_8])]),c_0_12]),
[proof] ).
%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.00/0.01 % Problem : SET020+1 : TPTP v9.3.1. Bugfixed v5.4.0.
% 0.00/0.02 % Command : run_E /export/starexec/sandbox2/benchmark/theBenchmark.p 300 THM
% 0.03/0.30 % Computer : n012.cluster.edu
% 0.03/0.30 % Model : x86_64 x86_64
% 0.03/0.30 % CPU : Intel(R) Xeon(R) CPU E5-2620 v4 @ 2.10GHz
% 0.03/0.30 % Memory : 8046.5625MB
% 0.03/0.30 % OS : Linux 6.8.0-71-generic
% 0.03/0.30 % CPULimit : 300
% 0.03/0.30 % WCLimit : 300
% 0.03/0.30 % DateTime : Mon Sep 21 04:42:51 UTC 2026
% 0.03/0.30 % CPUTime :
% 0.03/0.30 Running run_E /export/starexec/sandbox2/benchmark/theBenchmark.p 300 THM
% 0.03/0.34 Running first-order theorem proving
% 0.03/0.34 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.07/0.36 % Version: 3.5.1
% 0.07/0.36 % Preprocessing class: FSMSSMSSSSSNFFN.
% 0.07/0.36 % Scheduled 4 strats onto 8 cores with 300 seconds (2400 total)
% 0.07/0.36 % Starting G-E--_208_C18_F1_SE_CS_SOS_SP_PS_S5PRR_RG_S04AN with 1500s (5) cores
% 0.07/0.36 % Starting new_bool_3 with 300s (1) cores
% 0.07/0.36 % Starting new_bool_1 with 300s (1) cores
% 0.07/0.36 % Starting sh5l with 300s (1) cores
% 0.07/0.36 % new_bool_3 with pid 1582086 completed with status 0
% 0.07/0.36 % Result found by new_bool_3
% 0.07/0.36 % Preprocessing class: FSMSSMSSSSSNFFN.
% 0.07/0.36 % Scheduled 4 strats onto 8 cores with 300 seconds (2400 total)
% 0.07/0.36 % Starting G-E--_208_C18_F1_SE_CS_SOS_SP_PS_S5PRR_RG_S04AN with 1500s (5) cores
% 0.07/0.36 % Starting new_bool_3 with 300s (1) cores
% 0.07/0.36 % (lift_lambdas = 0, lambda_to_forall = 0,unroll_only_formulas = 0, sine = GSinE(CountFormulas,hypos,1.5,,3,20000,1.0))
% 0.07/0.36 % SinE strategy is GSinE(CountFormulas,hypos,1.5,,3,20000,1.0)
% 0.07/0.36 % Search class: FHHSF-FFSS21-SFFFFFNN
% 0.07/0.36 % Scheduled 5 strats onto 1 cores with 300 seconds (300 total)
% 0.07/0.36 % Starting SubtermCWHack with 31s (1) cores
% 0.07/0.36 % SubtermCWHack with pid 1582089 completed with status 0
% 0.07/0.36 % Result found by SubtermCWHack
% 0.07/0.36 % Preprocessing class: FSMSSMSSSSSNFFN.
% 0.07/0.36 % Scheduled 4 strats onto 8 cores with 300 seconds (2400 total)
% 0.07/0.36 % Starting G-E--_208_C18_F1_SE_CS_SOS_SP_PS_S5PRR_RG_S04AN with 1500s (5) cores
% 0.07/0.36 % Starting new_bool_3 with 300s (1) cores
% 0.07/0.36 % (lift_lambdas = 0, lambda_to_forall = 0,unroll_only_formulas = 0, sine = GSinE(CountFormulas,hypos,1.5,,3,20000,1.0))
% 0.07/0.36 % SinE strategy is GSinE(CountFormulas,hypos,1.5,,3,20000,1.0)
% 0.07/0.36 % Search class: FHHSF-FFSS21-SFFFFFNN
% 0.07/0.36 % Scheduled 5 strats onto 1 cores with 300 seconds (300 total)
% 0.07/0.36 % Starting SubtermCWHack with 31s (1) cores
% 0.07/0.36 % Preprocessing time : 0.001 s
% 0.07/0.36
% 0.07/0.36 % Proof found!
% 0.07/0.36 % SZS status Theorem
% 0.07/0.36 % SZS output start CNFRefutation
% See solution above
% 0.07/0.36 % Parsed axioms : 44
% 0.07/0.36 % Removed by relevancy pruning/SinE : 40
% 0.07/0.36 % Initial clauses : 10
% 0.07/0.36 % Removed in clause preprocessing : 0
% 0.07/0.36 % Initial clauses in saturation : 10
% 0.07/0.36 % Processed clauses : 13
% 0.07/0.36 % ...of these trivial : 0
% 0.07/0.36 % ...subsumed : 0
% 0.07/0.36 % ...remaining for further processing : 12
% 0.07/0.36 % Other redundant clauses eliminated : 0
% 0.07/0.36 % Clauses deleted for lack of memory : 0
% 0.07/0.36 % Backward-subsumed : 0
% 0.07/0.36 % Backward-rewritten : 1
% 0.07/0.36 % Generated clauses : 4
% 0.07/0.36 % ...of the previous two non-redundant : 5
% 0.07/0.36 % ...aggressively subsumed : 0
% 0.07/0.36 % Contextual simplify-reflections : 0
% 0.07/0.36 % Paramodulations : 4
% 0.07/0.36 % Factorizations : 0
% 0.07/0.36 % NegExts : 0
% 0.07/0.36 % Equation resolutions : 0
% 0.07/0.36 % Disequality decompositions : 0
% 0.07/0.36 % Total rewrite steps : 5
% 0.07/0.36 % ...of those cached : 2
% 0.07/0.36 % Propositional unsat checks : 0
% 0.07/0.36 % Propositional check models : 0
% 0.07/0.36 % Propositional check unsatisfiable : 0
% 0.07/0.36 % Propositional clauses : 0
% 0.07/0.36 % Propositional clauses after purity: 0
% 0.07/0.36 % Propositional unsat core size : 0
% 0.07/0.36 % Propositional preprocessing time : 0.000
% 0.07/0.36 % Propositional encoding time : 0.000
% 0.07/0.36 % Propositional solver time : 0.000
% 0.07/0.36 % Success case prop preproc time : 0.000
% 0.07/0.36 % Success case prop encoding time : 0.000
% 0.07/0.36 % Success case prop solver time : 0.000
% 0.07/0.36 % Current number of processed clauses : 11
% 0.07/0.36 % Positive orientable unit clauses : 4
% 0.07/0.36 % Positive unorientable unit clauses: 0
% 0.07/0.36 % Negative unit clauses : 1
% 0.07/0.36 % Non-unit-clauses : 6
% 0.07/0.36 % Current number of unprocessed clauses: 2
% 0.07/0.36 % ...number of literals in the above : 5
% 0.07/0.36 % Current number of archived formulas : 0
% 0.07/0.36 % Current number of archived clauses : 1
% 0.07/0.36 % Clause-clause subsumption calls (NU) : 2
% 0.07/0.36 % Rec. Clause-clause subsumption calls : 2
% 0.07/0.36 % Non-unit clause-clause subsumptions : 0
% 0.07/0.36 % Unit Clause-clause subsumption calls : 2
% 0.07/0.36 % Rewrite failures with RHS unbound : 0
% 0.07/0.36 % BW rewrite match attempts : 1
% 0.07/0.36 % BW rewrite match successes : 1
% 0.07/0.36 % Condensation attempts : 0
% 0.07/0.36 % Condensation successes : 0
% 0.07/0.36 % Termbank termtop insertions : 1126
% 0.07/0.36 % Search garbage collected termcells : 431
% 0.07/0.36
% 0.07/0.36 % -------------------------------------------------
% 0.07/0.36 % User time : 0.002 s
% 0.07/0.36 % System time : 0.003 s
% 0.07/0.36 % Total time : 0.005 s
% 0.07/0.36 % Maximum resident set size: 3692 pages
% 0.07/0.36
% 0.07/0.36 % -------------------------------------------------
% 0.07/0.36 % User time : 0.004 s
% 0.07/0.36 % System time : 0.007 s
% 0.07/0.36 % Total time : 0.011 s
% 0.07/0.36 % Maximum resident set size: 4608 pages
% 0.07/0.36 % E exiting
%------------------------------------------------------------------------------