%------------------------------------------------------------------------------
% File : E---3.5.1
% Problem : SEU252+1 : TPTP v9.3.1. Released v3.3.0.
% Transfm : none
% Format : tptp:raw
% Command : run_E /export/starexec/sandbox2/benchmark/theBenchmark.p 300 THM
% Computer : n006.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:24:28 PM UTC 2026
% Result : Theorem 0.15s 0.54s
% Output : CNFRefutation 0.15s
% Verified :
% SZS Type : Refutation
% Derivation depth : 6
% Number of leaves : 6
% Syntax : Number of formulae : 30 ( 4 unt; 0 def)
% Number of atoms : 107 ( 0 equ)
% Maximal formula atoms : 10 ( 3 avg)
% Number of connectives : 128 ( 51 ~; 52 |; 12 &)
% ( 3 <=>; 10 =>; 0 <=; 0 <~>)
% Maximal formula depth : 10 ( 5 avg)
% Maximal term depth : 4 ( 1 avg)
% Number of predicates : 4 ( 3 usr; 1 prp; 0-2 aty)
% Number of functors : 7 ( 7 usr; 2 con; 0-2 aty)
% Number of variables : 63 ( 3 sgn 32 !; 0 ?)
% Comments :
%------------------------------------------------------------------------------
fof(t16_wellord1,axiom,
! [X1,X2,X3] :
( relation(X3)
=> ( in(X1,relation_restriction(X3,X2))
<=> ( in(X1,cartesian_product2(X2,X2))
& in(X1,X3) ) ) ),
file('/export/starexec/sandbox2/benchmark/theBenchmark.p',t16_wellord1) ).
fof(t106_zfmisc_1,axiom,
! [X1,X2,X3,X4] :
( in(ordered_pair(X1,X2),cartesian_product2(X3,X4))
<=> ( in(X2,X4)
& in(X1,X3) ) ),
file('/export/starexec/sandbox2/benchmark/theBenchmark.p',t106_zfmisc_1) ).
fof(t19_wellord1,axiom,
! [X1,X2,X3] :
( relation(X3)
=> ( in(X1,relation_field(relation_restriction(X3,X2)))
=> ( in(X1,X2)
& in(X1,relation_field(X3)) ) ) ),
file('/export/starexec/sandbox2/benchmark/theBenchmark.p',t19_wellord1) ).
fof(l1_wellord1,axiom,
! [X1] :
( relation(X1)
=> ( reflexive(X1)
<=> ! [X2] :
( in(X2,relation_field(X1))
=> in(ordered_pair(X2,X2),X1) ) ) ),
file('/export/starexec/sandbox2/benchmark/theBenchmark.p',l1_wellord1) ).
fof(dt_k2_wellord1,axiom,
! [X1,X2] :
( relation(X1)
=> relation(relation_restriction(X1,X2)) ),
file('/export/starexec/sandbox2/benchmark/theBenchmark.p',dt_k2_wellord1) ).
fof(t22_wellord1,conjecture,
! [X1,X2] :
( relation(X2)
=> ( reflexive(X2)
=> reflexive(relation_restriction(X2,X1)) ) ),
file('/export/starexec/sandbox2/benchmark/theBenchmark.p',t22_wellord1) ).
fof(c_0_6,plain,
! [X31,X32,X33] :
( ( ~ relation(X33)
| in(X31,relation_restriction(X33,X32))
| ~ in(X31,cartesian_product2(X32,X32))
| ~ in(X31,X33) )
& ( ~ relation(X33)
| ~ in(X31,relation_restriction(X33,X32))
| in(X31,cartesian_product2(X32,X32)) )
& ( ~ relation(X33)
| ~ in(X31,relation_restriction(X33,X32))
| in(X31,X33) ) ),
inference(distribute,[status(thm)],[inference(fof_nnf,[status(thm)],[inference(variable_rename,[status(thm)],[inference(fof_nnf,[status(thm)],[t16_wellord1])])])]) ).
fof(c_0_7,plain,
! [X18,X19,X20,X21] :
( ( in(ordered_pair(X18,X19),cartesian_product2(X20,X21))
| ~ in(X19,X21)
| ~ in(X18,X20) )
& ( ~ in(ordered_pair(X18,X19),cartesian_product2(X20,X21))
| in(X19,X21) )
& ( ~ in(ordered_pair(X18,X19),cartesian_product2(X20,X21))
| in(X18,X20) ) ),
inference(distribute,[status(thm)],[inference(fof_nnf,[status(thm)],[inference(variable_rename,[status(thm)],[inference(fof_nnf,[status(thm)],[t106_zfmisc_1])])])]) ).
fof(c_0_8,plain,
! [X22,X23,X24] :
( ( ~ relation(X24)
| ~ in(X22,relation_field(relation_restriction(X24,X23)))
| in(X22,X23) )
& ( ~ relation(X24)
| ~ in(X22,relation_field(relation_restriction(X24,X23)))
| in(X22,relation_field(X24)) ) ),
inference(distribute,[status(thm)],[inference(fof_nnf,[status(thm)],[inference(variable_rename,[status(thm)],[inference(fof_nnf,[status(thm)],[t19_wellord1])])])]) ).
fof(c_0_9,plain,
! [X7,X8] :
( ( ~ relation(X7)
| reflexive(X7)
| ~ in(ordered_pair(esk3_1(X7),esk3_1(X7)),X7) )
& ( ~ relation(X7)
| reflexive(X7)
| in(esk3_1(X7),relation_field(X7)) )
& ( ~ relation(X7)
| in(ordered_pair(X8,X8),X7)
| ~ in(X8,relation_field(X7))
| ~ reflexive(X7) ) ),
inference(distribute,[status(thm)],[inference(fof_nnf,[status(thm)],[inference(shift_quantors,[status(thm)],[inference(skolemize,[status(esa)],[inference(variable_rename,[status(thm)],[inference(fof_nnf,[status(thm)],[l1_wellord1])])])])])]) ).
fof(c_0_10,plain,
! [X10,X11] :
( relation(relation_restriction(X10,X11))
| ~ relation(X10) ),
inference(fof_nnf,[status(thm)],[inference(variable_rename,[status(thm)],[inference(fof_nnf,[status(thm)],[dt_k2_wellord1])])]) ).
cnf(c_0_11,plain,
( ~ relation(X2)
| ~ in(X1,cartesian_product2(X3,X3))
| ~ in(X1,X2)
| in(X1,relation_restriction(X2,X3)) ),
inference(split_conjunct,[status(thm)],[c_0_6]) ).
cnf(c_0_12,plain,
( ~ in(X3,X4)
| ~ in(X1,X2)
| in(ordered_pair(X1,X3),cartesian_product2(X2,X4)) ),
inference(split_conjunct,[status(thm)],[c_0_7]) ).
cnf(c_0_13,plain,
( ~ relation(X3)
| ~ in(X1,relation_field(relation_restriction(X3,X2)))
| in(X1,X2) ),
inference(split_conjunct,[status(thm)],[c_0_8]) ).
cnf(c_0_14,plain,
( ~ relation(X1)
| reflexive(X1)
| in(esk3_1(X1),relation_field(X1)) ),
inference(split_conjunct,[status(thm)],[c_0_9]) ).
cnf(c_0_15,plain,
( ~ relation(X1)
| relation(relation_restriction(X1,X2)) ),
inference(split_conjunct,[status(thm)],[c_0_10]) ).
fof(c_0_16,negated_conjecture,
~ ! [X1,X2] :
( relation(X2)
=> ( reflexive(X2)
=> reflexive(relation_restriction(X2,X1)) ) ),
inference(assume_negation,[status(cth)],[t22_wellord1]) ).
cnf(c_0_17,plain,
( ~ relation(X1)
| ~ in(ordered_pair(esk3_1(X1),esk3_1(X1)),X1)
| reflexive(X1) ),
inference(split_conjunct,[status(thm)],[c_0_9]) ).
cnf(c_0_18,plain,
( ~ in(X1,X4)
| ~ in(X2,X4)
| ~ in(ordered_pair(X1,X2),X3)
| ~ relation(X3)
| in(ordered_pair(X1,X2),relation_restriction(X3,X4)) ),
inference(spm,[status(thm)],[c_0_11,c_0_12]) ).
cnf(c_0_19,plain,
( ~ relation(X1)
| in(esk3_1(relation_restriction(X1,X2)),X2)
| reflexive(relation_restriction(X1,X2)) ),
inference(csr,[status(thm)],[inference(spm,[status(thm)],[c_0_13,c_0_14]),c_0_15]) ).
cnf(c_0_20,plain,
( ~ relation(X2)
| ~ in(X1,relation_field(relation_restriction(X2,X3)))
| in(X1,relation_field(X2)) ),
inference(split_conjunct,[status(thm)],[c_0_8]) ).
fof(c_0_21,negated_conjecture,
( ~ reflexive(relation_restriction(esk2_0,esk1_0))
& reflexive(esk2_0)
& relation(esk2_0) ),
inference(fof_nnf,[status(thm)],[inference(skolemize,[status(esa)],[inference(variable_rename,[status(thm)],[inference(fof_nnf,[status(thm)],[c_0_16])])])]) ).
cnf(c_0_22,plain,
( ~ in(ordered_pair(esk3_1(relation_restriction(X1,X2)),esk3_1(relation_restriction(X1,X2))),X1)
| ~ relation(X1)
| reflexive(relation_restriction(X1,X2)) ),
inference(csr,[status(thm)],[inference(csr,[status(thm)],[inference(spm,[status(thm)],[c_0_17,c_0_18]),c_0_19]),c_0_15]) ).
cnf(c_0_23,plain,
( ~ relation(X1)
| ~ in(X2,relation_field(X1))
| ~ reflexive(X1)
| in(ordered_pair(X2,X2),X1) ),
inference(split_conjunct,[status(thm)],[c_0_9]) ).
cnf(c_0_24,plain,
( ~ relation(X1)
| in(esk3_1(relation_restriction(X1,X2)),relation_field(X1))
| reflexive(relation_restriction(X1,X2)) ),
inference(csr,[status(thm)],[inference(spm,[status(thm)],[c_0_20,c_0_14]),c_0_15]) ).
cnf(c_0_25,negated_conjecture,
~ reflexive(relation_restriction(esk2_0,esk1_0)),
inference(split_conjunct,[status(thm)],[c_0_21]) ).
cnf(c_0_26,plain,
( ~ relation(X1)
| ~ reflexive(X1)
| reflexive(relation_restriction(X1,X2)) ),
inference(csr,[status(thm)],[inference(spm,[status(thm)],[c_0_22,c_0_23]),c_0_24]) ).
cnf(c_0_27,negated_conjecture,
reflexive(esk2_0),
inference(split_conjunct,[status(thm)],[c_0_21]) ).
cnf(c_0_28,negated_conjecture,
relation(esk2_0),
inference(split_conjunct,[status(thm)],[c_0_21]) ).
cnf(c_0_29,negated_conjecture,
$false,
inference(cn,[status(thm)],[inference(rw,[status(thm)],[inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_25,c_0_26]),c_0_27]),c_0_28])]),
[proof] ).
%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.00/0.03 % Problem : SEU252+1 : TPTP v9.3.1. Released v3.3.0.
% 0.00/0.05 % Command : run_E /export/starexec/sandbox2/benchmark/theBenchmark.p 300 THM
% 0.09/0.36 % Computer : n006.cluster.edu
% 0.09/0.36 % Model : x86_64 x86_64
% 0.09/0.36 % CPU : Intel(R) Xeon(R) CPU E5-2620 v4 @ 2.10GHz
% 0.09/0.36 % Memory : 8046.5625MB
% 0.09/0.36 % OS : Linux 6.8.0-71-generic
% 0.09/0.36 % CPULimit : 300
% 0.09/0.36 % WCLimit : 300
% 0.09/0.36 % DateTime : Mon Sep 21 06:02:57 UTC 2026
% 0.09/0.37 % CPUTime :
% 0.09/0.37 Running run_E /export/starexec/sandbox2/benchmark/theBenchmark.p 300 THM
% 0.15/0.45 Running first-order theorem proving
% 0.15/0.45 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.15/0.54 % Version: 3.5.1
% 0.15/0.54 % Preprocessing class: FSMSSMSSSSSNFFN.
% 0.15/0.54 % Scheduled 4 strats onto 8 cores with 300 seconds (2400 total)
% 0.15/0.54 % Starting G-E--_208_C18_F1_SE_CS_SOS_SP_PS_S5PRR_RG_S04AN with 1500s (5) cores
% 0.15/0.54 % Starting new_bool_3 with 300s (1) cores
% 0.15/0.54 % Starting new_bool_1 with 300s (1) cores
% 0.15/0.54 % Starting sh5l with 300s (1) cores
% 0.15/0.54 % new_bool_3 with pid 2149996 completed with status 0
% 0.15/0.54 % Result found by new_bool_3
% 0.15/0.54 % Preprocessing class: FSMSSMSSSSSNFFN.
% 0.15/0.54 % Scheduled 4 strats onto 8 cores with 300 seconds (2400 total)
% 0.15/0.54 % Starting G-E--_208_C18_F1_SE_CS_SOS_SP_PS_S5PRR_RG_S04AN with 1500s (5) cores
% 0.15/0.54 % Starting new_bool_3 with 300s (1) cores
% 0.15/0.54 % (lift_lambdas = 0, lambda_to_forall = 0,unroll_only_formulas = 0, sine = GSinE(CountFormulas,hypos,1.5,,3,20000,1.0))
% 0.15/0.54 % SinE strategy is GSinE(CountFormulas,hypos,1.5,,3,20000,1.0)
% 0.15/0.54 % Search class: FGHSF-FFSS21-SFFFFFNN
% 0.15/0.54 % Scheduled 5 strats onto 1 cores with 300 seconds (300 total)
% 0.15/0.54 % Starting SubtermCWHack with 31s (1) cores
% 0.15/0.54 % SubtermCWHack with pid 2150006 completed with status 0
% 0.15/0.54 % Result found by SubtermCWHack
% 0.15/0.54 % Preprocessing class: FSMSSMSSSSSNFFN.
% 0.15/0.54 % Scheduled 4 strats onto 8 cores with 300 seconds (2400 total)
% 0.15/0.54 % Starting G-E--_208_C18_F1_SE_CS_SOS_SP_PS_S5PRR_RG_S04AN with 1500s (5) cores
% 0.15/0.54 % Starting new_bool_3 with 300s (1) cores
% 0.15/0.54 % (lift_lambdas = 0, lambda_to_forall = 0,unroll_only_formulas = 0, sine = GSinE(CountFormulas,hypos,1.5,,3,20000,1.0))
% 0.15/0.54 % SinE strategy is GSinE(CountFormulas,hypos,1.5,,3,20000,1.0)
% 0.15/0.54 % Search class: FGHSF-FFSS21-SFFFFFNN
% 0.15/0.54 % Scheduled 5 strats onto 1 cores with 300 seconds (300 total)
% 0.15/0.54 % Starting SubtermCWHack with 31s (1) cores
% 0.15/0.54 % Preprocessing time : 0.002 s
% 0.15/0.54
% 0.15/0.54 % Proof found!
% 0.15/0.54 % SZS status Theorem
% 0.15/0.54 % SZS output start CNFRefutation
% See solution above
% 0.15/0.55 % Parsed axioms : 45
% 0.15/0.55 % Removed by relevancy pruning/SinE : 32
% 0.15/0.55 % Initial clauses : 22
% 0.15/0.55 % Removed in clause preprocessing : 0
% 0.15/0.55 % Initial clauses in saturation : 22
% 0.15/0.55 % Processed clauses : 172
% 0.15/0.55 % ...of these trivial : 0
% 0.15/0.55 % ...subsumed : 4
% 0.15/0.55 % ...remaining for further processing : 168
% 0.15/0.55 % Other redundant clauses eliminated : 0
% 0.15/0.55 % Clauses deleted for lack of memory : 0
% 0.15/0.55 % Backward-subsumed : 13
% 0.15/0.55 % Backward-rewritten : 0
% 0.15/0.55 % Generated clauses : 558
% 0.15/0.55 % ...of the previous two non-redundant : 538
% 0.15/0.55 % ...aggressively subsumed : 0
% 0.15/0.55 % Contextual simplify-reflections : 15
% 0.15/0.55 % Paramodulations : 558
% 0.15/0.55 % Factorizations : 0
% 0.15/0.55 % NegExts : 0
% 0.15/0.55 % Equation resolutions : 0
% 0.15/0.55 % Disequality decompositions : 0
% 0.15/0.55 % Total rewrite steps : 6
% 0.15/0.55 % ...of those cached : 4
% 0.15/0.55 % Propositional unsat checks : 0
% 0.15/0.55 % Propositional check models : 0
% 0.15/0.55 % Propositional check unsatisfiable : 0
% 0.15/0.55 % Propositional clauses : 0
% 0.15/0.55 % Propositional clauses after purity: 0
% 0.15/0.55 % Propositional unsat core size : 0
% 0.15/0.55 % Propositional preprocessing time : 0.000
% 0.15/0.55 % Propositional encoding time : 0.000
% 0.15/0.55 % Propositional solver time : 0.000
% 0.15/0.55 % Success case prop preproc time : 0.000
% 0.15/0.55 % Success case prop encoding time : 0.000
% 0.15/0.55 % Success case prop solver time : 0.000
% 0.15/0.55 % Current number of processed clauses : 155
% 0.15/0.55 % Positive orientable unit clauses : 3
% 0.15/0.55 % Positive unorientable unit clauses: 0
% 0.15/0.55 % Negative unit clauses : 6
% 0.15/0.55 % Non-unit-clauses : 146
% 0.15/0.55 % Current number of unprocessed clauses: 388
% 0.15/0.55 % ...number of literals in the above : 2574
% 0.15/0.55 % Current number of archived formulas : 0
% 0.15/0.55 % Current number of archived clauses : 13
% 0.15/0.55 % Clause-clause subsumption calls (NU) : 6168
% 0.15/0.55 % Rec. Clause-clause subsumption calls : 2061
% 0.15/0.55 % Non-unit clause-clause subsumptions : 32
% 0.15/0.55 % Unit Clause-clause subsumption calls : 21
% 0.15/0.55 % Rewrite failures with RHS unbound : 0
% 0.15/0.55 % BW rewrite match attempts : 0
% 0.15/0.55 % BW rewrite match successes : 0
% 0.15/0.55 % Condensation attempts : 0
% 0.15/0.55 % Condensation successes : 0
% 0.15/0.55 % Termbank termtop insertions : 21779
% 0.15/0.55 % Search garbage collected termcells : 402
% 0.15/0.55
% 0.15/0.55 % -------------------------------------------------
% 0.15/0.55 % User time : 0.050 s
% 0.15/0.55 % System time : 0.010 s
% 0.15/0.55 % Total time : 0.060 s
% 0.15/0.55 % Maximum resident set size: 3612 pages
% 0.15/0.55
% 0.15/0.55 % -------------------------------------------------
% 0.15/0.55 % User time : 0.055 s
% 0.15/0.55 % System time : 0.015 s
% 0.15/0.55 % Total time : 0.070 s
% 0.15/0.55 % Maximum resident set size: 4864 pages
% 0.15/0.55 % E exiting
%------------------------------------------------------------------------------