%------------------------------------------------------------------------------
% File : E-SAT---3.5.1
% Problem : SET988+1 : TPTP v9.3.1. Released v3.2.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:19:02 PM UTC 2026
% Result : Theorem 0.16s 10.47s
% Output : CNFRefutation 0.16s
% Verified :
% SZS Type : Refutation
% Derivation depth : 10
% Number of leaves : 3
% Syntax : Number of formulae : 23 ( 4 unt; 0 def)
% Number of atoms : 80 ( 21 equ)
% Maximal formula atoms : 10 ( 3 avg)
% Number of connectives : 91 ( 34 ~; 25 |; 22 &)
% ( 3 <=>; 7 =>; 0 <=; 0 <~>)
% Maximal formula depth : 11 ( 5 avg)
% Maximal term depth : 3 ( 1 avg)
% Number of predicates : 5 ( 3 usr; 1 prp; 0-2 aty)
% Number of functors : 10 ( 10 usr; 1 con; 0-2 aty)
% Number of variables : 60 ( 2 sgn 47 !; 0 ?)
% Comments :
%------------------------------------------------------------------------------
fof(t2_funct_1,conjecture,
! [X1] :
( ( ! [X2,X3,X4] :
( ( in(ordered_pair(X2,X4),X1)
& in(ordered_pair(X2,X3),X1) )
=> X3 = X4 )
& ! [X2] :
~ ( ! [X3,X4] : ordered_pair(X3,X4) != X2
& in(X2,X1) ) )
=> ( function(X1)
& relation(X1) ) ),
file('/export/starexec/sandbox2/benchmark/theBenchmark.p',t2_funct_1) ).
fof(d1_relat_1,axiom,
! [X1] :
( relation(X1)
<=> ! [X2] :
~ ( ! [X3,X4] : X2 != ordered_pair(X3,X4)
& in(X2,X1) ) ),
file('/export/starexec/sandbox2/benchmark/theBenchmark.p',d1_relat_1) ).
fof(d1_funct_1,axiom,
! [X1] :
( function(X1)
<=> ! [X2,X3,X4] :
( ( in(ordered_pair(X2,X4),X1)
& in(ordered_pair(X2,X3),X1) )
=> X3 = X4 ) ),
file('/export/starexec/sandbox2/benchmark/theBenchmark.p',d1_funct_1) ).
fof(c_0_3,negated_conjecture,
~ ! [X1] :
( ( ! [X2,X3,X4] :
( ( in(ordered_pair(X2,X4),X1)
& in(ordered_pair(X2,X3),X1) )
=> X3 = X4 )
& ! [X2] :
~ ( ! [X3,X4] : ordered_pair(X3,X4) != X2
& in(X2,X1) ) )
=> ( function(X1)
& relation(X1) ) ),
inference(assume_negation,[status(cth)],[t2_funct_1]) ).
fof(c_0_4,plain,
! [X1] :
( relation(X1)
<=> ! [X2] :
~ ( ! [X3,X4] : X2 != ordered_pair(X3,X4)
& in(X2,X1) ) ),
inference(fof_simplification,[status(thm)],[d1_relat_1]) ).
fof(c_0_5,negated_conjecture,
~ ! [X1] :
( ( ! [X2,X3,X4] :
( ( in(ordered_pair(X2,X4),X1)
& in(ordered_pair(X2,X3),X1) )
=> X3 = X4 )
& ! [X2] :
~ ( ! [X3,X4] : ordered_pair(X3,X4) != X2
& in(X2,X1) ) )
=> ( function(X1)
& relation(X1) ) ),
inference(fof_simplification,[status(thm)],[c_0_3]) ).
fof(c_0_6,plain,
! [X26,X27,X30,X32,X33] :
( ( relation(X30)
| esk13_1(X30) != ordered_pair(X32,X33) )
& ( relation(X30)
| in(esk13_1(X30),X30) )
& ( X27 = ordered_pair(esk11_2(X26,X27),esk12_2(X26,X27))
| ~ in(X27,X26)
| ~ relation(X26) ) ),
inference(distribute,[status(thm)],[inference(fof_nnf,[status(thm)],[inference(shift_quantors,[status(thm)],[inference(skolemize,[status(esa)],[inference(variable_rename,[status(thm)],[inference(shift_quantors,[status(thm)],[inference(fof_nnf,[status(thm)],[c_0_4])])])])])])]) ).
fof(c_0_7,negated_conjecture,
! [X6,X9,X10,X11] :
( ( ~ function(esk1_0)
| ~ relation(esk1_0) )
& ( X10 = X11
| ~ in(ordered_pair(X9,X11),esk1_0)
| ~ in(ordered_pair(X9,X10),esk1_0) )
& ( ordered_pair(esk2_1(X6),esk3_1(X6)) = X6
| ~ in(X6,esk1_0) ) ),
inference(fof_nnf,[status(thm)],[inference(shift_quantors,[status(thm)],[inference(skolemize,[status(esa)],[inference(variable_rename,[status(thm)],[inference(fof_nnf,[status(thm)],[c_0_5])])])])]) ).
cnf(c_0_8,plain,
( esk13_1(X1) != ordered_pair(X2,X3)
| relation(X1) ),
inference(split_conjunct,[status(thm)],[c_0_6]) ).
cnf(c_0_9,negated_conjecture,
( ~ in(X1,esk1_0)
| ordered_pair(esk2_1(X1),esk3_1(X1)) = X1 ),
inference(split_conjunct,[status(thm)],[c_0_7]) ).
cnf(c_0_10,negated_conjecture,
( ~ in(esk13_1(X1),esk1_0)
| relation(X1) ),
inference(er,[status(thm)],[inference(spm,[status(thm)],[c_0_8,c_0_9])]) ).
cnf(c_0_11,plain,
( relation(X1)
| in(esk13_1(X1),X1) ),
inference(split_conjunct,[status(thm)],[c_0_6]) ).
fof(c_0_12,plain,
! [X14,X15,X16,X17,X18] :
( ( function(X18)
| esk6_1(X18) != esk7_1(X18) )
& ( function(X18)
| in(ordered_pair(esk5_1(X18),esk7_1(X18)),X18) )
& ( function(X18)
| in(ordered_pair(esk5_1(X18),esk6_1(X18)),X18) )
& ( X16 = X17
| ~ in(ordered_pair(X15,X17),X14)
| ~ in(ordered_pair(X15,X16),X14)
| ~ function(X14) ) ),
inference(distribute,[status(thm)],[inference(fof_nnf,[status(thm)],[inference(shift_quantors,[status(thm)],[inference(skolemize,[status(esa)],[inference(variable_rename,[status(thm)],[inference(shift_quantors,[status(thm)],[inference(fof_nnf,[status(thm)],[d1_funct_1])])])])])])]) ).
cnf(c_0_13,negated_conjecture,
( ~ function(esk1_0)
| ~ relation(esk1_0) ),
inference(split_conjunct,[status(thm)],[c_0_7]) ).
cnf(c_0_14,negated_conjecture,
relation(esk1_0),
inference(spm,[status(thm)],[c_0_10,c_0_11]) ).
cnf(c_0_15,negated_conjecture,
( ~ in(ordered_pair(X1,X3),esk1_0)
| ~ in(ordered_pair(X1,X2),esk1_0)
| X2 = X3 ),
inference(split_conjunct,[status(thm)],[c_0_7]) ).
cnf(c_0_16,plain,
( function(X1)
| in(ordered_pair(esk5_1(X1),esk7_1(X1)),X1) ),
inference(split_conjunct,[status(thm)],[c_0_12]) ).
cnf(c_0_17,negated_conjecture,
~ function(esk1_0),
inference(cn,[status(thm)],[inference(rw,[status(thm)],[c_0_13,c_0_14])]) ).
cnf(c_0_18,negated_conjecture,
( ~ in(ordered_pair(esk5_1(esk1_0),X1),esk1_0)
| X1 = esk7_1(esk1_0) ),
inference(sr,[status(thm)],[inference(spm,[status(thm)],[c_0_15,c_0_16]),c_0_17]) ).
cnf(c_0_19,plain,
( function(X1)
| in(ordered_pair(esk5_1(X1),esk6_1(X1)),X1) ),
inference(split_conjunct,[status(thm)],[c_0_12]) ).
cnf(c_0_20,plain,
( esk6_1(X1) != esk7_1(X1)
| function(X1) ),
inference(split_conjunct,[status(thm)],[c_0_12]) ).
cnf(c_0_21,negated_conjecture,
esk7_1(esk1_0) = esk6_1(esk1_0),
inference(sr,[status(thm)],[inference(spm,[status(thm)],[c_0_18,c_0_19]),c_0_17]) ).
cnf(c_0_22,negated_conjecture,
$false,
inference(sr,[status(thm)],[inference(spm,[status(thm)],[c_0_20,c_0_21]),c_0_17]),
[proof] ).
%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.00/0.03 % Problem : SET988+1 : TPTP v9.3.1. Released v3.2.0.
% 0.00/0.05 % Command : run_E /export/starexec/sandbox2/benchmark/theBenchmark.p 300 THM
% 0.11/10.39 % Computer : n002.cluster.edu
% 0.11/10.39 % Model : x86_64 x86_64
% 0.11/10.39 % CPU : Intel(R) Xeon(R) CPU E5-2620 v4 @ 2.10GHz
% 0.11/10.39 % Memory : 8046.5625MB
% 0.11/10.39 % OS : Linux 6.8.0-71-generic
% 0.11/10.39 % CPULimit : 300
% 0.11/10.39 % WCLimit : 300
% 0.11/10.39 % DateTime : Mon Sep 21 05:49:29 UTC 2026
% 0.11/10.39 % CPUTime :
% 0.11/10.39 Running run_E /export/starexec/sandbox2/benchmark/theBenchmark.p 300 THM
% 0.16/10.44 Running first-order theorem proving
% 0.16/10.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
% 0.16/10.47 % Version: 3.5.1
% 0.16/10.47 % Preprocessing class: FSMSSMSSSSSNFFN.
% 0.16/10.47 % Scheduled 4 strats onto 8 cores with 300 seconds (2400 total)
% 0.16/10.47 % Starting G-E--_208_C18_F1_SE_CS_SOS_SP_PS_S5PRR_RG_S04AN with 1500s (5) cores
% 0.16/10.47 % Starting new_bool_3 with 300s (1) cores
% 0.16/10.47 % Starting new_bool_1 with 300s (1) cores
% 0.16/10.47 % Starting sh5l with 300s (1) cores
% 0.16/10.47 % sh5l with pid 2561094 completed with status 0
% 0.16/10.47 % Result found by sh5l
% 0.16/10.47 % Preprocessing class: FSMSSMSSSSSNFFN.
% 0.16/10.47 % Scheduled 4 strats onto 8 cores with 300 seconds (2400 total)
% 0.16/10.47 % Starting G-E--_208_C18_F1_SE_CS_SOS_SP_PS_S5PRR_RG_S04AN with 1500s (5) cores
% 0.16/10.47 % Starting new_bool_3 with 300s (1) cores
% 0.16/10.47 % Starting new_bool_1 with 300s (1) cores
% 0.16/10.47 % Starting sh5l with 300s (1) cores
% 0.16/10.47 % (lift_lambdas = 0, lambda_to_forall = 0,unroll_only_formulas = 0, sine = gf500_gu_R04_F100_L20000)
% 0.16/10.47 % SinE strategy is gf500_gu_R04_F100_L20000
% 0.16/10.47 % Search class: FGHSM-FFMM21-SFFFFFNN
% 0.16/10.47 % Scheduled 7 strats onto 1 cores with 300 seconds (300 total)
% 0.16/10.47 % Starting SubtermCWHack with 28s (1) cores
% 0.16/10.47 % SubtermCWHack with pid 2561095 completed with status 0
% 0.16/10.47 % Result found by SubtermCWHack
% 0.16/10.47 % Preprocessing class: FSMSSMSSSSSNFFN.
% 0.16/10.47 % Scheduled 4 strats onto 8 cores with 300 seconds (2400 total)
% 0.16/10.47 % Starting G-E--_208_C18_F1_SE_CS_SOS_SP_PS_S5PRR_RG_S04AN with 1500s (5) cores
% 0.16/10.47 % Starting new_bool_3 with 300s (1) cores
% 0.16/10.47 % Starting new_bool_1 with 300s (1) cores
% 0.16/10.47 % Starting sh5l with 300s (1) cores
% 0.16/10.47 % (lift_lambdas = 0, lambda_to_forall = 0,unroll_only_formulas = 0, sine = gf500_gu_R04_F100_L20000)
% 0.16/10.47 % SinE strategy is gf500_gu_R04_F100_L20000
% 0.16/10.47 % Search class: FGHSM-FFMM21-SFFFFFNN
% 0.16/10.47 % Scheduled 7 strats onto 1 cores with 300 seconds (300 total)
% 0.16/10.47 % Starting SubtermCWHack with 28s (1) cores
% 0.16/10.47 % Preprocessing time : 0.002 s
% 0.16/10.47
% 0.16/10.47 % Proof found!
% 0.16/10.47 % SZS status Theorem
% 0.16/10.47 % SZS output start CNFRefutation
% See solution above
% 0.16/10.47 % Parsed axioms : 33
% 0.16/10.47 % Removed by relevancy pruning/SinE : 0
% 0.16/10.47 % Initial clauses : 50
% 0.16/10.47 % Removed in clause preprocessing : 0
% 0.16/10.47 % Initial clauses in saturation : 50
% 0.16/10.47 % Processed clauses : 235
% 0.16/10.47 % ...of these trivial : 5
% 0.16/10.47 % ...subsumed : 95
% 0.16/10.47 % ...remaining for further processing : 135
% 0.16/10.47 % Other redundant clauses eliminated : 4
% 0.16/10.47 % Clauses deleted for lack of memory : 0
% 0.16/10.47 % Backward-subsumed : 1
% 0.16/10.47 % Backward-rewritten : 8
% 0.16/10.47 % Generated clauses : 320
% 0.16/10.47 % ...of the previous two non-redundant : 258
% 0.16/10.47 % ...aggressively subsumed : 0
% 0.16/10.47 % Contextual simplify-reflections : 2
% 0.16/10.47 % Paramodulations : 316
% 0.16/10.47 % Factorizations : 0
% 0.16/10.47 % NegExts : 0
% 0.16/10.47 % Equation resolutions : 4
% 0.16/10.47 % Disequality decompositions : 0
% 0.16/10.47 % Total rewrite steps : 59
% 0.16/10.47 % ...of those cached : 40
% 0.16/10.47 % Propositional unsat checks : 0
% 0.16/10.47 % Propositional check models : 0
% 0.16/10.47 % Propositional check unsatisfiable : 0
% 0.16/10.47 % Propositional clauses : 0
% 0.16/10.47 % Propositional clauses after purity: 0
% 0.16/10.47 % Propositional unsat core size : 0
% 0.16/10.47 % Propositional preprocessing time : 0.000
% 0.16/10.47 % Propositional encoding time : 0.000
% 0.16/10.47 % Propositional solver time : 0.000
% 0.16/10.47 % Success case prop preproc time : 0.000
% 0.16/10.47 % Success case prop encoding time : 0.000
% 0.16/10.47 % Success case prop solver time : 0.000
% 0.16/10.47 % Current number of processed clauses : 126
% 0.16/10.47 % Positive orientable unit clauses : 27
% 0.16/10.47 % Positive unorientable unit clauses: 1
% 0.16/10.47 % Negative unit clauses : 13
% 0.16/10.47 % Non-unit-clauses : 85
% 0.16/10.47 % Current number of unprocessed clauses: 68
% 0.16/10.47 % ...number of literals in the above : 167
% 0.16/10.47 % Current number of archived formulas : 0
% 0.16/10.47 % Current number of archived clauses : 9
% 0.16/10.47 % Clause-clause subsumption calls (NU) : 1176
% 0.16/10.47 % Rec. Clause-clause subsumption calls : 887
% 0.16/10.47 % Non-unit clause-clause subsumptions : 64
% 0.16/10.47 % Unit Clause-clause subsumption calls : 106
% 0.16/10.47 % Rewrite failures with RHS unbound : 0
% 0.16/10.47 % BW rewrite match attempts : 17
% 0.16/10.47 % BW rewrite match successes : 8
% 0.16/10.47 % Condensation attempts : 0
% 0.16/10.47 % Condensation successes : 0
% 0.16/10.47 % Termbank termtop insertions : 5806
% 0.16/10.47 % Search garbage collected termcells : 553
% 0.16/10.47
% 0.16/10.47 % -------------------------------------------------
% 0.16/10.47 % User time : 0.016 s
% 0.16/10.47 % System time : 0.000 s
% 0.16/10.47 % Total time : 0.016 s
% 0.16/10.47 % Maximum resident set size: 3656 pages
% 0.16/10.47
% 0.16/10.47 % -------------------------------------------------
% 0.16/10.47 % User time : 0.017 s
% 0.16/10.47 % System time : 0.006 s
% 0.16/10.47 % Total time : 0.022 s
% 0.16/10.47 % Maximum resident set size: 4864 pages
% 0.16/10.47 % E exiting
%------------------------------------------------------------------------------