%------------------------------------------------------------------------------
% File : E-SAT---3.5.1
% Problem : SEU186+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 : n016.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:28:26 PM UTC 2026
% Result : Theorem 0.23s 10.55s
% Output : CNFRefutation 0.23s
% Verified :
% SZS Type : Refutation
% Derivation depth : 10
% Number of leaves : 7
% Syntax : Number of formulae : 35 ( 16 unt; 0 def)
% Number of atoms : 73 ( 21 equ)
% Maximal formula atoms : 7 ( 2 avg)
% Number of connectives : 71 ( 33 ~; 22 |; 6 &)
% ( 2 <=>; 8 =>; 0 <=; 0 <~>)
% Maximal formula depth : 10 ( 4 avg)
% Maximal term depth : 4 ( 1 avg)
% Number of predicates : 6 ( 4 usr; 1 prp; 0-2 aty)
% Number of functors : 9 ( 9 usr; 2 con; 0-2 aty)
% Number of variables : 65 ( 4 sgn 40 !; 1 ?)
% Comments :
%------------------------------------------------------------------------------
fof(t56_relat_1,conjecture,
! [X1] :
( relation(X1)
=> ( ! [X2,X3] : ~ in(ordered_pair(X2,X3),X1)
=> X1 = empty_set ) ),
file('/export/starexec/sandbox2/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/sandbox2/benchmark/theBenchmark.p',d1_relat_1) ).
fof(d5_tarski,axiom,
! [X1,X2] : ordered_pair(X1,X2) = unordered_pair(unordered_pair(X1,X2),singleton(X1)),
file('/export/starexec/sandbox2/benchmark/theBenchmark.p',d5_tarski) ).
fof(commutativity_k2_tarski,axiom,
! [X1,X2] : unordered_pair(X1,X2) = unordered_pair(X2,X1),
file('/export/starexec/sandbox2/benchmark/theBenchmark.p',commutativity_k2_tarski) ).
fof(t2_subset,axiom,
! [X1,X2] :
( element(X1,X2)
=> ( in(X1,X2)
| empty(X2) ) ),
file('/export/starexec/sandbox2/benchmark/theBenchmark.p',t2_subset) ).
fof(existence_m1_subset_1,axiom,
! [X1] :
? [X2] : element(X2,X1),
file('/export/starexec/sandbox2/benchmark/theBenchmark.p',existence_m1_subset_1) ).
fof(t6_boole,axiom,
! [X1] :
( empty(X1)
=> X1 = empty_set ),
file('/export/starexec/sandbox2/benchmark/theBenchmark.p',t6_boole) ).
fof(c_0_7,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_8,negated_conjecture,
~ ! [X1] :
( relation(X1)
=> ( ! [X2,X3] : ~ in(ordered_pair(X2,X3),X1)
=> X1 = empty_set ) ),
inference(fof_simplification,[status(thm)],[c_0_7]) ).
fof(c_0_9,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_10,negated_conjecture,
! [X36,X37] :
( esk9_0 != empty_set
& ~ in(ordered_pair(X36,X37),esk9_0)
& relation(esk9_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_8])])])])]) ).
fof(c_0_11,plain,
! [X18,X19] : ordered_pair(X18,X19) = unordered_pair(unordered_pair(X18,X19),singleton(X18)),
inference(variable_rename,[status(thm)],[d5_tarski]) ).
fof(c_0_12,plain,
! [X10,X11,X14,X16,X17] :
( ( relation(X14)
| esk3_1(X14) != ordered_pair(X16,X17) )
& ( relation(X14)
| in(esk3_1(X14),X14) )
& ( X11 = ordered_pair(esk1_2(X10,X11),esk2_2(X10,X11))
| ~ in(X11,X10)
| ~ relation(X10) ) ),
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_9])])])])])])]) ).
cnf(c_0_13,negated_conjecture,
~ in(ordered_pair(X1,X2),esk9_0),
inference(split_conjunct,[status(thm)],[c_0_10]) ).
cnf(c_0_14,plain,
ordered_pair(X1,X2) = unordered_pair(unordered_pair(X1,X2),singleton(X1)),
inference(split_conjunct,[status(thm)],[c_0_11]) ).
fof(c_0_15,plain,
! [X8,X9] : unordered_pair(X8,X9) = unordered_pair(X9,X8),
inference(variable_rename,[status(thm)],[commutativity_k2_tarski]) ).
cnf(c_0_16,plain,
( ~ in(X2,X1)
| ~ relation(X1)
| X2 = ordered_pair(esk1_2(X1,X2),esk2_2(X1,X2)) ),
inference(split_conjunct,[status(thm)],[c_0_12]) ).
cnf(c_0_17,negated_conjecture,
~ in(unordered_pair(unordered_pair(X1,X2),singleton(X1)),esk9_0),
inference(rw,[status(thm)],[c_0_13,c_0_14]) ).
cnf(c_0_18,plain,
unordered_pair(X1,X2) = unordered_pair(X2,X1),
inference(split_conjunct,[status(thm)],[c_0_15]) ).
cnf(c_0_19,plain,
( ~ in(X2,X1)
| ~ relation(X1)
| X2 = unordered_pair(unordered_pair(esk1_2(X1,X2),esk2_2(X1,X2)),singleton(esk1_2(X1,X2))) ),
inference(rw,[status(thm)],[c_0_16,c_0_14]) ).
fof(c_0_20,plain,
! [X33,X34] :
( in(X33,X34)
| empty(X34)
| ~ element(X33,X34) ),
inference(fof_nnf,[status(thm)],[inference(variable_rename,[status(thm)],[inference(fof_nnf,[status(thm)],[t2_subset])])]) ).
fof(c_0_21,plain,
! [X20] : element(esk4_1(X20),X20),
inference(skolemize,[status(esa)],[inference(variable_rename,[status(thm)],[existence_m1_subset_1])]) ).
cnf(c_0_22,negated_conjecture,
~ in(unordered_pair(singleton(X1),unordered_pair(X1,X2)),esk9_0),
inference(spm,[status(thm)],[c_0_17,c_0_18]) ).
cnf(c_0_23,plain,
( ~ in(X2,X1)
| ~ relation(X1)
| unordered_pair(singleton(esk1_2(X1,X2)),unordered_pair(esk1_2(X1,X2),esk2_2(X1,X2))) = X2 ),
inference(rw,[status(thm)],[c_0_19,c_0_18]) ).
cnf(c_0_24,plain,
( ~ element(X1,X2)
| in(X1,X2)
| empty(X2) ),
inference(split_conjunct,[status(thm)],[c_0_20]) ).
cnf(c_0_25,plain,
element(esk4_1(X1),X1),
inference(split_conjunct,[status(thm)],[c_0_21]) ).
cnf(c_0_26,negated_conjecture,
( ~ in(X2,X1)
| ~ in(X2,esk9_0)
| ~ relation(X1) ),
inference(spm,[status(thm)],[c_0_22,c_0_23]) ).
cnf(c_0_27,plain,
( in(esk4_1(X1),X1)
| empty(X1) ),
inference(spm,[status(thm)],[c_0_24,c_0_25]) ).
fof(c_0_28,plain,
! [X38] :
( X38 = empty_set
| ~ empty(X38) ),
inference(fof_nnf,[status(thm)],[inference(variable_rename,[status(thm)],[inference(fof_nnf,[status(thm)],[t6_boole])])]) ).
cnf(c_0_29,negated_conjecture,
( ~ in(esk4_1(esk9_0),X1)
| ~ relation(X1)
| empty(esk9_0) ),
inference(spm,[status(thm)],[c_0_26,c_0_27]) ).
cnf(c_0_30,negated_conjecture,
relation(esk9_0),
inference(split_conjunct,[status(thm)],[c_0_10]) ).
cnf(c_0_31,plain,
( ~ empty(X1)
| X1 = empty_set ),
inference(split_conjunct,[status(thm)],[c_0_28]) ).
cnf(c_0_32,negated_conjecture,
empty(esk9_0),
inference(cn,[status(thm)],[inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_29,c_0_27]),c_0_30])]) ).
cnf(c_0_33,negated_conjecture,
esk9_0 != empty_set,
inference(split_conjunct,[status(thm)],[c_0_10]) ).
cnf(c_0_34,negated_conjecture,
$false,
inference(sr,[status(thm)],[inference(spm,[status(thm)],[c_0_31,c_0_32]),c_0_33]),
[proof] ).
%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.00/0.05 % Problem : SEU186+1 : TPTP v9.3.1. Released v3.3.0.
% 0.00/0.07 % Command : run_E /export/starexec/sandbox2/benchmark/theBenchmark.p 300 THM
% 0.18/10.45 % Computer : n016.cluster.edu
% 0.18/10.45 % Model : x86_64 x86_64
% 0.18/10.45 % CPU : Intel(R) Xeon(R) CPU E5-2620 v4 @ 2.10GHz
% 0.18/10.45 % Memory : 8046.5625MB
% 0.18/10.45 % OS : Linux 6.8.0-71-generic
% 0.18/10.46 % CPULimit : 300
% 0.18/10.46 % WCLimit : 300
% 0.18/10.46 % DateTime : Mon Sep 21 06:00:18 UTC 2026
% 0.18/10.46 % CPUTime :
% 0.18/10.46 Running run_E /export/starexec/sandbox2/benchmark/theBenchmark.p 300 THM
% 0.23/10.51 Running first-order theorem proving
% 0.23/10.51 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.23/10.55 % Version: 3.5.1
% 0.23/10.55 % Preprocessing class: FSMSSMSSSSSNFFN.
% 0.23/10.55 % Scheduled 4 strats onto 8 cores with 300 seconds (2400 total)
% 0.23/10.55 % Starting G-E--_208_C18_F1_SE_CS_SOS_SP_PS_S5PRR_RG_S04AN with 1500s (5) cores
% 0.23/10.55 % Starting new_bool_3 with 300s (1) cores
% 0.23/10.55 % Starting new_bool_1 with 300s (1) cores
% 0.23/10.55 % Starting sh5l with 300s (1) cores
% 0.23/10.55 % G-E--_208_C18_F1_SE_CS_SOS_SP_PS_S5PRR_RG_S04AN with pid 1710825 completed with status 0
% 0.23/10.55 % Result found by G-E--_208_C18_F1_SE_CS_SOS_SP_PS_S5PRR_RG_S04AN
% 0.23/10.55 % Preprocessing class: FSMSSMSSSSSNFFN.
% 0.23/10.55 % Scheduled 4 strats onto 8 cores with 300 seconds (2400 total)
% 0.23/10.55 % Starting G-E--_208_C18_F1_SE_CS_SOS_SP_PS_S5PRR_RG_S04AN with 1500s (5) cores
% 0.23/10.55 % (lift_lambdas = 1, lambda_to_forall = 1,unroll_only_formulas = 1, sine = Auto)
% 0.23/10.55 % No SInE strategy applied
% 0.23/10.55 % Search class: FGHSS-FFSM21-MFFFFFNN
% 0.23/10.55 % partial match(1): FGUSS-FFSM21-MFFFFFNN
% 0.23/10.55 % Scheduled 7 strats onto 5 cores with 1500 seconds (1500 total)
% 0.23/10.55 % Starting SubtermCWHack with 136s (1) cores
% 0.23/10.55 % Starting G-E--_208_C18_F1_SE_CS_SOS_SP_PS_S5PRR_RG_S04AN with 151s (1) cores
% 0.23/10.55 % Starting sh3 with 271s (1) cores
% 0.23/10.55 % Starting ho_unfolding_3 with 271s (1) cores
% 0.23/10.55 % Starting new_ho_10_cnf2 with 271s (1) cores
% 0.23/10.55 % SubtermCWHack with pid 1710831 completed with status 0
% 0.23/10.55 % Result found by SubtermCWHack
% 0.23/10.55 % Preprocessing class: FSMSSMSSSSSNFFN.
% 0.23/10.55 % Scheduled 4 strats onto 8 cores with 300 seconds (2400 total)
% 0.23/10.55 % Starting G-E--_208_C18_F1_SE_CS_SOS_SP_PS_S5PRR_RG_S04AN with 1500s (5) cores
% 0.23/10.55 % (lift_lambdas = 1, lambda_to_forall = 1,unroll_only_formulas = 1, sine = Auto)
% 0.23/10.55 % No SInE strategy applied
% 0.23/10.55 % Search class: FGHSS-FFSM21-MFFFFFNN
% 0.23/10.55 % partial match(1): FGUSS-FFSM21-MFFFFFNN
% 0.23/10.55 % Scheduled 7 strats onto 5 cores with 1500 seconds (1500 total)
% 0.23/10.55 % Starting SubtermCWHack with 136s (1) cores
% 0.23/10.55 % Preprocessing time : 0.001 s
% 0.23/10.55
% 0.23/10.55 % Proof found!
% 0.23/10.55 % SZS status Theorem
% 0.23/10.55 % SZS output start CNFRefutation
% See solution above
% 0.23/10.55 % Parsed axioms : 26
% 0.23/10.55 % Removed by relevancy pruning/SinE : 0
% 0.23/10.55 % Initial clauses : 33
% 0.23/10.55 % Removed in clause preprocessing : 6
% 0.23/10.55 % Initial clauses in saturation : 27
% 0.23/10.55 % Processed clauses : 58
% 0.23/10.55 % ...of these trivial : 1
% 0.23/10.55 % ...subsumed : 18
% 0.23/10.55 % ...remaining for further processing : 39
% 0.23/10.55 % Other redundant clauses eliminated : 0
% 0.23/10.55 % Clauses deleted for lack of memory : 0
% 0.23/10.55 % Backward-subsumed : 0
% 0.23/10.55 % Backward-rewritten : 4
% 0.23/10.55 % Generated clauses : 50
% 0.23/10.55 % ...of the previous two non-redundant : 44
% 0.23/10.55 % ...aggressively subsumed : 0
% 0.23/10.55 % Contextual simplify-reflections : 0
% 0.23/10.55 % Paramodulations : 50
% 0.23/10.55 % Factorizations : 0
% 0.23/10.55 % NegExts : 0
% 0.23/10.55 % Equation resolutions : 0
% 0.23/10.55 % Disequality decompositions : 0
% 0.23/10.55 % Total rewrite steps : 11
% 0.23/10.55 % ...of those cached : 4
% 0.23/10.55 % Propositional unsat checks : 0
% 0.23/10.55 % Propositional check models : 0
% 0.23/10.55 % Propositional check unsatisfiable : 0
% 0.23/10.55 % Propositional clauses : 0
% 0.23/10.55 % Propositional clauses after purity: 0
% 0.23/10.55 % Propositional unsat core size : 0
% 0.23/10.55 % Propositional preprocessing time : 0.000
% 0.23/10.55 % Propositional encoding time : 0.000
% 0.23/10.55 % Propositional solver time : 0.000
% 0.23/10.55 % Success case prop preproc time : 0.000
% 0.23/10.55 % Success case prop encoding time : 0.000
% 0.23/10.55 % Success case prop solver time : 0.000
% 0.23/10.55 % Current number of processed clauses : 35
% 0.23/10.55 % Positive orientable unit clauses : 8
% 0.23/10.55 % Positive unorientable unit clauses: 1
% 0.23/10.55 % Negative unit clauses : 9
% 0.23/10.55 % Non-unit-clauses : 17
% 0.23/10.55 % Current number of unprocessed clauses: 13
% 0.23/10.55 % ...number of literals in the above : 34
% 0.23/10.55 % Current number of archived formulas : 0
% 0.23/10.55 % Current number of archived clauses : 5
% 0.23/10.55 % Clause-clause subsumption calls (NU) : 24
% 0.23/10.55 % Rec. Clause-clause subsumption calls : 24
% 0.23/10.55 % Non-unit clause-clause subsumptions : 2
% 0.23/10.55 % Unit Clause-clause subsumption calls : 12
% 0.23/10.55 % Rewrite failures with RHS unbound : 0
% 0.23/10.55 % BW rewrite match attempts : 5
% 0.23/10.55 % BW rewrite match successes : 5
% 0.23/10.55 % Condensation attempts : 0
% 0.23/10.55 % Condensation successes : 0
% 0.23/10.55 % Termbank termtop insertions : 1827
% 0.23/10.55 % Search garbage collected termcells : 267
% 0.23/10.55
% 0.23/10.55 % -------------------------------------------------
% 0.23/10.55 % User time : 0.009 s
% 0.23/10.55 % System time : 0.004 s
% 0.23/10.55 % Total time : 0.013 s
% 0.23/10.55 % Maximum resident set size: 3644 pages
% 0.23/10.55
% 0.23/10.55 % -------------------------------------------------
% 0.23/10.55 % User time : 0.020 s
% 0.23/10.55 % System time : 0.019 s
% 0.23/10.55 % Total time : 0.039 s
% 0.23/10.55 % Maximum resident set size: 4864 pages
% 0.23/10.55 % E exiting
%------------------------------------------------------------------------------