%------------------------------------------------------------------------------
% File : E---3.5.1
% Problem : SEU186+1 : TPTP v9.3.1. Released v3.3.0.
% Transfm : none
% Format : tptp:raw
% Command : run_E /export/starexec/sandbox/benchmark/theBenchmark.p 300 THM
% Computer : n003.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:10 PM UTC 2026
% Result : Theorem 0.12s 0.45s
% Output : CNFRefutation 0.12s
% Verified :
% SZS Type : Refutation
% Derivation depth : 8
% Number of leaves : 5
% Syntax : Number of formulae : 25 ( 8 unt; 0 def)
% Number of atoms : 59 ( 13 equ)
% Maximal formula atoms : 7 ( 2 avg)
% Number of connectives : 61 ( 27 ~; 18 |; 6 &)
% ( 2 <=>; 8 =>; 0 <=; 0 <~>)
% Maximal formula depth : 10 ( 4 avg)
% Maximal term depth : 3 ( 1 avg)
% Number of predicates : 6 ( 4 usr; 1 prp; 0-2 aty)
% Number of functors : 7 ( 7 usr; 2 con; 0-2 aty)
% Number of variables : 45 ( 2 sgn 32 !; 1 ?)
% Comments :
%------------------------------------------------------------------------------
fof(t56_relat_1,conjecture,
! [X1] :
( relation(X1)
=> ( ! [X2,X3] : ~ in(ordered_pair(X2,X3),X1)
=> X1 = empty_set ) ),
file('/export/starexec/sandbox/benchmark/theBenchmark.p',t56_relat_1) ).
fof(d1_relat_1,axiom,
! [X1] :
( relation(X1)
<=> ! [X2] :
~ ( ! [X3,X4] : X2 != ordered_pair(X3,X4)
& in(X2,X1) ) ),
file('/export/starexec/sandbox/benchmark/theBenchmark.p',d1_relat_1) ).
fof(t2_subset,axiom,
! [X1,X2] :
( element(X1,X2)
=> ( in(X1,X2)
| empty(X2) ) ),
file('/export/starexec/sandbox/benchmark/theBenchmark.p',t2_subset) ).
fof(existence_m1_subset_1,axiom,
! [X1] :
? [X2] : element(X2,X1),
file('/export/starexec/sandbox/benchmark/theBenchmark.p',existence_m1_subset_1) ).
fof(t6_boole,axiom,
! [X1] :
( empty(X1)
=> X1 = empty_set ),
file('/export/starexec/sandbox/benchmark/theBenchmark.p',t6_boole) ).
fof(c_0_5,negated_conjecture,
~ ! [X1] :
( relation(X1)
=> ( ! [X2,X3] : ~ in(ordered_pair(X2,X3),X1)
=> X1 = empty_set ) ),
inference(assume_negation,[status(cth)],[t56_relat_1]) ).
fof(c_0_6,negated_conjecture,
~ ! [X1] :
( relation(X1)
=> ( ! [X2,X3] : ~ in(ordered_pair(X2,X3),X1)
=> X1 = empty_set ) ),
inference(fof_simplification,[status(thm)],[c_0_5]) ).
fof(c_0_7,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_8,negated_conjecture,
! [X6,X7] :
( esk1_0 != empty_set
& ~ in(ordered_pair(X6,X7),esk1_0)
& relation(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_6])])])])]) ).
fof(c_0_9,plain,
! [X11,X12,X15,X17,X18] :
( ( relation(X15)
| esk4_1(X15) != ordered_pair(X17,X18) )
& ( relation(X15)
| in(esk4_1(X15),X15) )
& ( X12 = ordered_pair(esk2_2(X11,X12),esk3_2(X11,X12))
| ~ in(X12,X11)
| ~ relation(X11) ) ),
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_7])])])])])])]) ).
fof(c_0_10,plain,
! [X21,X22] :
( in(X21,X22)
| empty(X22)
| ~ element(X21,X22) ),
inference(fof_nnf,[status(thm)],[inference(variable_rename,[status(thm)],[inference(fof_nnf,[status(thm)],[t2_subset])])]) ).
fof(c_0_11,plain,
! [X38] : element(esk9_1(X38),X38),
inference(skolemize,[status(esa)],[inference(variable_rename,[status(thm)],[existence_m1_subset_1])]) ).
cnf(c_0_12,negated_conjecture,
~ in(ordered_pair(X1,X2),esk1_0),
inference(split_conjunct,[status(thm)],[c_0_8]) ).
cnf(c_0_13,plain,
( ~ in(X2,X1)
| ~ relation(X1)
| X2 = ordered_pair(esk2_2(X1,X2),esk3_2(X1,X2)) ),
inference(split_conjunct,[status(thm)],[c_0_9]) ).
cnf(c_0_14,plain,
( ~ element(X1,X2)
| in(X1,X2)
| empty(X2) ),
inference(split_conjunct,[status(thm)],[c_0_10]) ).
cnf(c_0_15,plain,
element(esk9_1(X1),X1),
inference(split_conjunct,[status(thm)],[c_0_11]) ).
cnf(c_0_16,negated_conjecture,
( ~ in(X2,X1)
| ~ in(X2,esk1_0)
| ~ relation(X1) ),
inference(spm,[status(thm)],[c_0_12,c_0_13]) ).
cnf(c_0_17,plain,
( in(esk9_1(X1),X1)
| empty(X1) ),
inference(spm,[status(thm)],[c_0_14,c_0_15]) ).
fof(c_0_18,plain,
! [X8] :
( X8 = empty_set
| ~ empty(X8) ),
inference(fof_nnf,[status(thm)],[inference(variable_rename,[status(thm)],[inference(fof_nnf,[status(thm)],[t6_boole])])]) ).
cnf(c_0_19,negated_conjecture,
( ~ in(esk9_1(esk1_0),X1)
| ~ relation(X1)
| empty(esk1_0) ),
inference(spm,[status(thm)],[c_0_16,c_0_17]) ).
cnf(c_0_20,negated_conjecture,
relation(esk1_0),
inference(split_conjunct,[status(thm)],[c_0_8]) ).
cnf(c_0_21,plain,
( ~ empty(X1)
| X1 = empty_set ),
inference(split_conjunct,[status(thm)],[c_0_18]) ).
cnf(c_0_22,negated_conjecture,
empty(esk1_0),
inference(cn,[status(thm)],[inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_19,c_0_17]),c_0_20])]) ).
cnf(c_0_23,negated_conjecture,
esk1_0 != empty_set,
inference(split_conjunct,[status(thm)],[c_0_8]) ).
cnf(c_0_24,negated_conjecture,
$false,
inference(sr,[status(thm)],[inference(spm,[status(thm)],[c_0_21,c_0_22]),c_0_23]),
[proof] ).
%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.00/0.03 % Problem : SEU186+1 : TPTP v9.3.1. Released v3.3.0.
% 0.00/0.05 % Command : run_E /export/starexec/sandbox/benchmark/theBenchmark.p 300 THM
% 0.12/0.37 % Computer : n003.cluster.edu
% 0.12/0.37 % Model : x86_64 x86_64
% 0.12/0.37 % CPU : Intel(R) Xeon(R) CPU E5-2620 v4 @ 2.10GHz
% 0.12/0.37 % Memory : 8046.5625MB
% 0.12/0.37 % OS : Linux 6.8.0-71-generic
% 0.12/0.37 % CPULimit : 300
% 0.12/0.37 % WCLimit : 300
% 0.12/0.37 % DateTime : Mon Sep 21 05:57:01 UTC 2026
% 0.12/0.38 % CPUTime :
% 0.12/0.38 Running run_E /export/starexec/sandbox/benchmark/theBenchmark.p 300 THM
% 0.12/0.42 Running first-order theorem proving
% 0.12/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
% 0.12/0.44 % Version: 3.5.1
% 0.12/0.44 % Preprocessing class: FSMSSMSSSSSNFFN.
% 0.12/0.44 % Scheduled 4 strats onto 8 cores with 300 seconds (2400 total)
% 0.12/0.44 % Starting G-E--_208_C18_F1_SE_CS_SOS_SP_PS_S5PRR_RG_S04AN with 1500s (5) cores
% 0.12/0.44 % Starting new_bool_3 with 300s (1) cores
% 0.12/0.44 % Starting new_bool_1 with 300s (1) cores
% 0.12/0.44 % Starting sh5l with 300s (1) cores
% 0.12/0.44 % sh5l with pid 3556999 completed with status 0
% 0.12/0.44 % Result found by sh5l
% 0.12/0.44 % Preprocessing class: FSMSSMSSSSSNFFN.
% 0.12/0.44 % Scheduled 4 strats onto 8 cores with 300 seconds (2400 total)
% 0.12/0.44 % Starting G-E--_208_C18_F1_SE_CS_SOS_SP_PS_S5PRR_RG_S04AN with 1500s (5) cores
% 0.12/0.44 % Starting new_bool_3 with 300s (1) cores
% 0.12/0.44 % Starting new_bool_1 with 300s (1) cores
% 0.12/0.44 % Starting sh5l with 300s (1) cores
% 0.12/0.44 % (lift_lambdas = 0, lambda_to_forall = 0,unroll_only_formulas = 0, sine = gf500_gu_R04_F100_L20000)
% 0.12/0.44 % SinE strategy is gf500_gu_R04_F100_L20000
% 0.12/0.44 % Search class: FGHSS-FFSM21-SFFFFFNN
% 0.12/0.44 % partial match(1): FGHSS-FFSF21-SFFFFFNN
% 0.12/0.44 % Scheduled 5 strats onto 1 cores with 300 seconds (300 total)
% 0.12/0.44 % Starting SubtermCWHack with 31s (1) cores
% 0.12/0.45 % SubtermCWHack with pid 3557000 completed with status 0
% 0.12/0.45 % Result found by SubtermCWHack
% 0.12/0.45 % Preprocessing class: FSMSSMSSSSSNFFN.
% 0.12/0.45 % Scheduled 4 strats onto 8 cores with 300 seconds (2400 total)
% 0.12/0.45 % Starting G-E--_208_C18_F1_SE_CS_SOS_SP_PS_S5PRR_RG_S04AN with 1500s (5) cores
% 0.12/0.45 % Starting new_bool_3 with 300s (1) cores
% 0.12/0.45 % Starting new_bool_1 with 300s (1) cores
% 0.12/0.45 % Starting sh5l with 300s (1) cores
% 0.12/0.45 % (lift_lambdas = 0, lambda_to_forall = 0,unroll_only_formulas = 0, sine = gf500_gu_R04_F100_L20000)
% 0.12/0.45 % SinE strategy is gf500_gu_R04_F100_L20000
% 0.12/0.45 % Search class: FGHSS-FFSM21-SFFFFFNN
% 0.12/0.45 % partial match(1): FGHSS-FFSF21-SFFFFFNN
% 0.12/0.45 % Scheduled 5 strats onto 1 cores with 300 seconds (300 total)
% 0.12/0.45 % Starting SubtermCWHack with 31s (1) cores
% 0.12/0.45 % Preprocessing time : 0.001 s
% 0.12/0.45
% 0.12/0.45 % Proof found!
% 0.12/0.45 % SZS status Theorem
% 0.12/0.45 % SZS output start CNFRefutation
% See solution above
% 0.12/0.45 % Parsed axioms : 26
% 0.12/0.45 % Removed by relevancy pruning/SinE : 5
% 0.12/0.45 % Initial clauses : 28
% 0.12/0.45 % Removed in clause preprocessing : 0
% 0.12/0.45 % Initial clauses in saturation : 28
% 0.12/0.45 % Processed clauses : 50
% 0.12/0.45 % ...of these trivial : 3
% 0.12/0.45 % ...subsumed : 7
% 0.12/0.45 % ...remaining for further processing : 40
% 0.12/0.45 % Other redundant clauses eliminated : 1
% 0.12/0.45 % Clauses deleted for lack of memory : 0
% 0.12/0.45 % Backward-subsumed : 0
% 0.12/0.45 % Backward-rewritten : 4
% 0.12/0.45 % Generated clauses : 47
% 0.12/0.45 % ...of the previous two non-redundant : 35
% 0.12/0.45 % ...aggressively subsumed : 0
% 0.12/0.45 % Contextual simplify-reflections : 0
% 0.12/0.45 % Paramodulations : 46
% 0.12/0.45 % Factorizations : 0
% 0.12/0.45 % NegExts : 0
% 0.12/0.45 % Equation resolutions : 1
% 0.12/0.45 % Disequality decompositions : 0
% 0.12/0.45 % Total rewrite steps : 16
% 0.12/0.45 % ...of those cached : 6
% 0.12/0.45 % Propositional unsat checks : 0
% 0.12/0.45 % Propositional check models : 0
% 0.12/0.45 % Propositional check unsatisfiable : 0
% 0.12/0.45 % Propositional clauses : 0
% 0.12/0.45 % Propositional clauses after purity: 0
% 0.12/0.45 % Propositional unsat core size : 0
% 0.12/0.45 % Propositional preprocessing time : 0.000
% 0.12/0.45 % Propositional encoding time : 0.000
% 0.12/0.45 % Propositional solver time : 0.000
% 0.12/0.45 % Success case prop preproc time : 0.000
% 0.12/0.45 % Success case prop encoding time : 0.000
% 0.12/0.45 % Success case prop solver time : 0.000
% 0.12/0.45 % Current number of processed clauses : 36
% 0.12/0.45 % Positive orientable unit clauses : 11
% 0.12/0.45 % Positive unorientable unit clauses: 1
% 0.12/0.45 % Negative unit clauses : 7
% 0.12/0.45 % Non-unit-clauses : 17
% 0.12/0.45 % Current number of unprocessed clauses: 13
% 0.12/0.45 % ...number of literals in the above : 13
% 0.12/0.45 % Current number of archived formulas : 0
% 0.12/0.45 % Current number of archived clauses : 4
% 0.12/0.45 % Clause-clause subsumption calls (NU) : 26
% 0.12/0.45 % Rec. Clause-clause subsumption calls : 26
% 0.12/0.45 % Non-unit clause-clause subsumptions : 2
% 0.12/0.45 % Unit Clause-clause subsumption calls : 12
% 0.12/0.45 % Rewrite failures with RHS unbound : 0
% 0.12/0.45 % BW rewrite match attempts : 6
% 0.12/0.45 % BW rewrite match successes : 5
% 0.12/0.45 % Condensation attempts : 0
% 0.12/0.45 % Condensation successes : 0
% 0.12/0.45 % Termbank termtop insertions : 1699
% 0.12/0.45 % Search garbage collected termcells : 266
% 0.12/0.45
% 0.12/0.45 % -------------------------------------------------
% 0.12/0.45 % User time : 0.004 s
% 0.12/0.45 % System time : 0.003 s
% 0.12/0.45 % Total time : 0.007 s
% 0.12/0.45 % Maximum resident set size: 3644 pages
% 0.12/0.45
% 0.12/0.45 % -------------------------------------------------
% 0.12/0.45 % User time : 0.008 s
% 0.12/0.45 % System time : 0.006 s
% 0.12/0.45 % Total time : 0.014 s
% 0.12/0.45 % Maximum resident set size: 4864 pages
% 0.12/0.45 % E exiting
%------------------------------------------------------------------------------