%------------------------------------------------------------------------------
% File : E---3.5.1
% Problem : SET108+1 : TPTP v9.3.1. Bugfixed v5.4.0.
% Transfm : none
% Format : tptp:raw
% Command : run_E /export/starexec/sandbox/benchmark/theBenchmark.p 300 THM
% Computer : n017.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:37 PM UTC 2026
% Result : Theorem 0.13s 0.43s
% Output : CNFRefutation 0.13s
% Verified :
% SZS Type : Refutation
% Derivation depth : 5
% Number of leaves : 1
% Syntax : Number of formulae : 11 ( 4 unt; 0 def)
% Number of atoms : 44 ( 25 equ)
% Maximal formula atoms : 12 ( 4 avg)
% Number of connectives : 54 ( 21 ~; 18 |; 15 &)
% ( 0 <=>; 0 =>; 0 <=; 0 <~>)
% Maximal formula depth : 12 ( 5 avg)
% Maximal term depth : 3 ( 1 avg)
% Number of predicates : 3 ( 1 usr; 1 prp; 0-2 aty)
% Number of functors : 5 ( 5 usr; 2 con; 0-2 aty)
% Number of variables : 20 ( 0 sgn 4 !; 8 ?)
% Comments :
%------------------------------------------------------------------------------
fof(existence_of_first_and_second,conjecture,
! [X1] :
? [X3,X4] :
( ( X4 = X1
& X3 = X1
& ~ ? [X2,X5] :
( X1 = ordered_pair(X2,X5)
& member(X5,universal_class)
& member(X2,universal_class) ) )
| ( X1 = ordered_pair(X3,X4)
& member(X4,universal_class)
& member(X3,universal_class) ) ),
file('/export/starexec/sandbox/benchmark/theBenchmark.p',existence_of_first_and_second) ).
fof(c_0_1,negated_conjecture,
~ ! [X1] :
? [X3,X4] :
( ( X4 = X1
& X3 = X1
& ~ ? [X2,X5] :
( X1 = ordered_pair(X2,X5)
& member(X5,universal_class)
& member(X2,universal_class) ) )
| ( X1 = ordered_pair(X3,X4)
& member(X4,universal_class)
& member(X3,universal_class) ) ),
inference(assume_negation,[status(cth)],[existence_of_first_and_second]) ).
fof(c_0_2,negated_conjecture,
! [X11,X12] :
( ( X12 != esk1_0
| X11 != esk1_0
| esk1_0 = ordered_pair(esk2_2(X11,X12),esk3_2(X11,X12)) )
& ( X12 != esk1_0
| X11 != esk1_0
| member(esk3_2(X11,X12),universal_class) )
& ( X12 != esk1_0
| X11 != esk1_0
| member(esk2_2(X11,X12),universal_class) )
& ( esk1_0 != ordered_pair(X11,X12)
| ~ member(X12,universal_class)
| ~ member(X11,universal_class) ) ),
inference(distribute,[status(thm)],[inference(fof_nnf,[status(thm)],[inference(skolemize,[status(esa)],[inference(variable_rename,[status(thm)],[inference(fof_nnf,[status(thm)],[c_0_1])])])])]) ).
cnf(c_0_3,negated_conjecture,
( X2 != esk1_0
| X1 != esk1_0
| esk1_0 = ordered_pair(esk2_2(X1,X2),esk3_2(X1,X2)) ),
inference(split_conjunct,[status(thm)],[c_0_2]) ).
cnf(c_0_4,negated_conjecture,
( X2 != esk1_0
| X1 != esk1_0
| member(esk3_2(X1,X2),universal_class) ),
inference(split_conjunct,[status(thm)],[c_0_2]) ).
cnf(c_0_5,negated_conjecture,
( X2 != esk1_0
| X1 != esk1_0
| member(esk2_2(X1,X2),universal_class) ),
inference(split_conjunct,[status(thm)],[c_0_2]) ).
cnf(c_0_6,negated_conjecture,
( esk1_0 != ordered_pair(X1,X2)
| ~ member(X2,universal_class)
| ~ member(X1,universal_class) ),
inference(split_conjunct,[status(thm)],[c_0_2]) ).
cnf(c_0_7,negated_conjecture,
ordered_pair(esk2_2(esk1_0,esk1_0),esk3_2(esk1_0,esk1_0)) = esk1_0,
inference(er,[status(thm)],[inference(er,[status(thm)],[c_0_3])]) ).
cnf(c_0_8,negated_conjecture,
member(esk3_2(esk1_0,esk1_0),universal_class),
inference(er,[status(thm)],[inference(er,[status(thm)],[c_0_4])]) ).
cnf(c_0_9,negated_conjecture,
member(esk2_2(esk1_0,esk1_0),universal_class),
inference(er,[status(thm)],[inference(er,[status(thm)],[c_0_5])]) ).
cnf(c_0_10,negated_conjecture,
$false,
inference(cn,[status(thm)],[inference(rw,[status(thm)],[inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_6,c_0_7]),c_0_8]),c_0_9])]),
[proof] ).
%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.00/0.02 % Problem : SET108+1 : TPTP v9.3.1. Bugfixed v5.4.0.
% 0.00/0.04 % Command : run_E /export/starexec/sandbox/benchmark/theBenchmark.p 300 THM
% 0.11/0.37 % Computer : n017.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:48:41 UTC 2026
% 0.11/0.37 % CPUTime :
% 0.11/0.37 Running run_E /export/starexec/sandbox/benchmark/theBenchmark.p 300 THM
% 0.13/0.41 Running first-order theorem proving
% 0.13/0.41 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.13/0.43 % Version: 3.5.1
% 0.13/0.43 % Preprocessing class: FSMSSMSSSSSNFFN.
% 0.13/0.43 % Scheduled 4 strats onto 8 cores with 300 seconds (2400 total)
% 0.13/0.43 % Starting G-E--_208_C18_F1_SE_CS_SOS_SP_PS_S5PRR_RG_S04AN with 1500s (5) cores
% 0.13/0.43 % Starting new_bool_3 with 300s (1) cores
% 0.13/0.43 % Starting new_bool_1 with 300s (1) cores
% 0.13/0.43 % Starting sh5l with 300s (1) cores
% 0.13/0.43 % new_bool_3 with pid 1466019 completed with status 0
% 0.13/0.43 % Result found by new_bool_3
% 0.13/0.43 % Preprocessing class: FSMSSMSSSSSNFFN.
% 0.13/0.43 % Scheduled 4 strats onto 8 cores with 300 seconds (2400 total)
% 0.13/0.43 % Starting G-E--_208_C18_F1_SE_CS_SOS_SP_PS_S5PRR_RG_S04AN with 1500s (5) cores
% 0.13/0.43 % Starting new_bool_3 with 300s (1) cores
% 0.13/0.43 % (lift_lambdas = 0, lambda_to_forall = 0,unroll_only_formulas = 0, sine = GSinE(CountFormulas,hypos,1.5,,3,20000,1.0))
% 0.13/0.43 % SinE strategy is GSinE(CountFormulas,hypos,1.5,,3,20000,1.0)
% 0.13/0.43 % Search class: FHHSF-FFSF22-SFFFFFNN
% 0.13/0.43 % partial match(1): FGHSF-FFSF22-SFFFFFNN
% 0.13/0.43 % Scheduled 5 strats onto 1 cores with 300 seconds (300 total)
% 0.13/0.43 % Starting SubtermCWHack with 31s (1) cores
% 0.13/0.43 % SubtermCWHack with pid 1466022 completed with status 0
% 0.13/0.43 % Result found by SubtermCWHack
% 0.13/0.43 % Preprocessing class: FSMSSMSSSSSNFFN.
% 0.13/0.43 % Scheduled 4 strats onto 8 cores with 300 seconds (2400 total)
% 0.13/0.43 % Starting G-E--_208_C18_F1_SE_CS_SOS_SP_PS_S5PRR_RG_S04AN with 1500s (5) cores
% 0.13/0.43 % Starting new_bool_3 with 300s (1) cores
% 0.13/0.43 % (lift_lambdas = 0, lambda_to_forall = 0,unroll_only_formulas = 0, sine = GSinE(CountFormulas,hypos,1.5,,3,20000,1.0))
% 0.13/0.43 % SinE strategy is GSinE(CountFormulas,hypos,1.5,,3,20000,1.0)
% 0.13/0.43 % Search class: FHHSF-FFSF22-SFFFFFNN
% 0.13/0.43 % partial match(1): FGHSF-FFSF22-SFFFFFNN
% 0.13/0.43 % Scheduled 5 strats onto 1 cores with 300 seconds (300 total)
% 0.13/0.43 % Starting SubtermCWHack with 31s (1) cores
% 0.13/0.43 % Preprocessing time : 0.001 s
% 0.13/0.43
% 0.13/0.43 % Proof found!
% 0.13/0.43 % SZS status Theorem
% 0.13/0.43 % SZS output start CNFRefutation
% See solution above
% 0.13/0.43 % Parsed axioms : 44
% 0.13/0.43 % Removed by relevancy pruning/SinE : 42
% 0.13/0.43 % Initial clauses : 7
% 0.13/0.43 % Removed in clause preprocessing : 0
% 0.13/0.43 % Initial clauses in saturation : 7
% 0.13/0.43 % Processed clauses : 10
% 0.13/0.43 % ...of these trivial : 0
% 0.13/0.43 % ...subsumed : 0
% 0.13/0.43 % ...remaining for further processing : 10
% 0.13/0.43 % Other redundant clauses eliminated : 6
% 0.13/0.43 % Clauses deleted for lack of memory : 0
% 0.13/0.43 % Backward-subsumed : 0
% 0.13/0.43 % Backward-rewritten : 0
% 0.13/0.43 % Generated clauses : 9
% 0.13/0.43 % ...of the previous two non-redundant : 3
% 0.13/0.43 % ...aggressively subsumed : 0
% 0.13/0.43 % Contextual simplify-reflections : 0
% 0.13/0.43 % Paramodulations : 6
% 0.13/0.43 % Factorizations : 0
% 0.13/0.43 % NegExts : 0
% 0.13/0.43 % Equation resolutions : 6
% 0.13/0.43 % Disequality decompositions : 0
% 0.13/0.43 % Total rewrite steps : 2
% 0.13/0.43 % ...of those cached : 0
% 0.13/0.43 % Propositional unsat checks : 0
% 0.13/0.43 % Propositional check models : 0
% 0.13/0.43 % Propositional check unsatisfiable : 0
% 0.13/0.43 % Propositional clauses : 0
% 0.13/0.43 % Propositional clauses after purity: 0
% 0.13/0.43 % Propositional unsat core size : 0
% 0.13/0.43 % Propositional preprocessing time : 0.000
% 0.13/0.43 % Propositional encoding time : 0.000
% 0.13/0.43 % Propositional solver time : 0.000
% 0.13/0.43 % Success case prop preproc time : 0.000
% 0.13/0.43 % Success case prop encoding time : 0.000
% 0.13/0.43 % Success case prop solver time : 0.000
% 0.13/0.43 % Current number of processed clauses : 7
% 0.13/0.43 % Positive orientable unit clauses : 3
% 0.13/0.43 % Positive unorientable unit clauses: 0
% 0.13/0.43 % Negative unit clauses : 0
% 0.13/0.43 % Non-unit-clauses : 4
% 0.13/0.43 % Current number of unprocessed clauses: 0
% 0.13/0.43 % ...number of literals in the above : 0
% 0.13/0.43 % Current number of archived formulas : 0
% 0.13/0.43 % Current number of archived clauses : 0
% 0.13/0.43 % Clause-clause subsumption calls (NU) : 2
% 0.13/0.43 % Rec. Clause-clause subsumption calls : 2
% 0.13/0.43 % Non-unit clause-clause subsumptions : 0
% 0.13/0.43 % Unit Clause-clause subsumption calls : 0
% 0.13/0.43 % Rewrite failures with RHS unbound : 0
% 0.13/0.43 % BW rewrite match attempts : 0
% 0.13/0.43 % BW rewrite match successes : 0
% 0.13/0.43 % Condensation attempts : 0
% 0.13/0.43 % Condensation successes : 0
% 0.13/0.43 % Termbank termtop insertions : 1060
% 0.13/0.43 % Search garbage collected termcells : 450
% 0.13/0.43
% 0.13/0.43 % -------------------------------------------------
% 0.13/0.43 % User time : 0.004 s
% 0.13/0.43 % System time : 0.002 s
% 0.13/0.43 % Total time : 0.006 s
% 0.13/0.43 % Maximum resident set size: 3692 pages
% 0.13/0.43
% 0.13/0.43 % -------------------------------------------------
% 0.13/0.43 % User time : 0.007 s
% 0.13/0.43 % System time : 0.006 s
% 0.13/0.43 % Total time : 0.013 s
% 0.13/0.43 % Maximum resident set size: 4608 pages
% 0.13/0.43 % E exiting
%------------------------------------------------------------------------------