%------------------------------------------------------------------------------
% File : E---3.5.1
% Problem : SEU159+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 : n015.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:02 PM UTC 2026
% Result : Theorem 0.12s 0.41s
% Output : CNFRefutation 0.12s
% Verified :
% SZS Type : Refutation
% Derivation depth : 8
% Number of leaves : 3
% Syntax : Number of formulae : 29 ( 6 unt; 0 def)
% Number of atoms : 97 ( 29 equ)
% Maximal formula atoms : 20 ( 3 avg)
% Number of connectives : 106 ( 38 ~; 51 |; 11 &)
% ( 5 <=>; 1 =>; 0 <=; 0 <~>)
% Maximal formula depth : 17 ( 4 avg)
% Maximal term depth : 3 ( 1 avg)
% Number of predicates : 4 ( 2 usr; 1 prp; 0-2 aty)
% Number of functors : 6 ( 6 usr; 3 con; 0-3 aty)
% Number of variables : 63 ( 4 sgn 26 !; 0 ?)
% Comments :
%------------------------------------------------------------------------------
fof(t38_zfmisc_1,conjecture,
! [X1,X2,X3] :
( subset(unordered_pair(X1,X2),X3)
<=> ( in(X2,X3)
& in(X1,X3) ) ),
file('/export/starexec/sandbox2/benchmark/theBenchmark.p',t38_zfmisc_1) ).
fof(d3_tarski,axiom,
! [X1,X2] :
( subset(X1,X2)
<=> ! [X3] :
( in(X3,X1)
=> in(X3,X2) ) ),
file('/export/starexec/sandbox2/benchmark/theBenchmark.p',d3_tarski) ).
fof(d2_tarski,axiom,
! [X1,X2,X3] :
( X3 = unordered_pair(X1,X2)
<=> ! [X4] :
( in(X4,X3)
<=> ( X4 = X2
| X4 = X1 ) ) ),
file('/export/starexec/sandbox2/benchmark/theBenchmark.p',d2_tarski) ).
fof(c_0_3,negated_conjecture,
~ ! [X1,X2,X3] :
( subset(unordered_pair(X1,X2),X3)
<=> ( in(X2,X3)
& in(X1,X3) ) ),
inference(assume_negation,[status(cth)],[t38_zfmisc_1]) ).
fof(c_0_4,plain,
! [X18,X19,X20,X21,X22] :
( ( subset(X21,X22)
| ~ in(esk2_2(X21,X22),X22) )
& ( subset(X21,X22)
| in(esk2_2(X21,X22),X21) )
& ( in(X20,X19)
| ~ in(X20,X18)
| ~ subset(X18,X19) ) ),
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)],[d3_tarski])])])])])])]) ).
fof(c_0_5,negated_conjecture,
( ( subset(unordered_pair(esk3_0,esk4_0),esk5_0)
| in(esk4_0,esk5_0) )
& ( subset(unordered_pair(esk3_0,esk4_0),esk5_0)
| in(esk3_0,esk5_0) )
& ( ~ in(esk4_0,esk5_0)
| ~ in(esk3_0,esk5_0)
| ~ subset(unordered_pair(esk3_0,esk4_0),esk5_0) ) ),
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_3])])])])]) ).
fof(c_0_6,plain,
! [X9,X10,X11,X12,X13,X14,X15,X16] :
( ( X16 = unordered_pair(X14,X15)
| esk1_3(X14,X15,X16) = X15
| esk1_3(X14,X15,X16) = X14
| in(esk1_3(X14,X15,X16),X16) )
& ( X16 = unordered_pair(X14,X15)
| ~ in(esk1_3(X14,X15,X16),X16)
| esk1_3(X14,X15,X16) != X15 )
& ( X16 = unordered_pair(X14,X15)
| ~ in(esk1_3(X14,X15,X16),X16)
| esk1_3(X14,X15,X16) != X14 )
& ( X11 != unordered_pair(X9,X10)
| in(X13,X11)
| X13 != X10 )
& ( X11 != unordered_pair(X9,X10)
| in(X13,X11)
| X13 != X9 )
& ( X11 != unordered_pair(X9,X10)
| X12 = X10
| X12 = X9
| ~ in(X12,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)],[d2_tarski])])])])])])]) ).
cnf(c_0_7,plain,
( ~ in(X3,X1)
| ~ subset(X1,X2)
| in(X3,X2) ),
inference(split_conjunct,[status(thm)],[c_0_4]) ).
cnf(c_0_8,negated_conjecture,
( subset(unordered_pair(esk3_0,esk4_0),esk5_0)
| in(esk3_0,esk5_0) ),
inference(split_conjunct,[status(thm)],[c_0_5]) ).
cnf(c_0_9,plain,
( X3 != unordered_pair(X2,X4)
| X1 != X2
| in(X1,X3) ),
inference(split_conjunct,[status(thm)],[c_0_6]) ).
cnf(c_0_10,plain,
( X2 != unordered_pair(X3,X4)
| ~ in(X1,X2)
| X1 = X4
| X1 = X3 ),
inference(split_conjunct,[status(thm)],[c_0_6]) ).
cnf(c_0_11,negated_conjecture,
( ~ in(X1,unordered_pair(esk3_0,esk4_0))
| in(X1,esk5_0)
| in(esk3_0,esk5_0) ),
inference(spm,[status(thm)],[c_0_7,c_0_8]) ).
cnf(c_0_12,plain,
in(X1,unordered_pair(X1,X2)),
inference(er,[status(thm)],[inference(er,[status(thm)],[c_0_9])]) ).
cnf(c_0_13,negated_conjecture,
( subset(unordered_pair(esk3_0,esk4_0),esk5_0)
| in(esk4_0,esk5_0) ),
inference(split_conjunct,[status(thm)],[c_0_5]) ).
cnf(c_0_14,plain,
( X3 != unordered_pair(X4,X2)
| X1 != X2
| in(X1,X3) ),
inference(split_conjunct,[status(thm)],[c_0_6]) ).
cnf(c_0_15,plain,
( ~ in(X1,unordered_pair(X3,X2))
| X1 = X3
| X1 = X2 ),
inference(er,[status(thm)],[c_0_10]) ).
cnf(c_0_16,plain,
( subset(X1,X2)
| in(esk2_2(X1,X2),X1) ),
inference(split_conjunct,[status(thm)],[c_0_4]) ).
cnf(c_0_17,negated_conjecture,
( ~ in(esk4_0,esk5_0)
| ~ in(esk3_0,esk5_0)
| ~ subset(unordered_pair(esk3_0,esk4_0),esk5_0) ),
inference(split_conjunct,[status(thm)],[c_0_5]) ).
cnf(c_0_18,negated_conjecture,
in(esk3_0,esk5_0),
inference(spm,[status(thm)],[c_0_11,c_0_12]) ).
cnf(c_0_19,negated_conjecture,
( ~ in(X1,unordered_pair(esk3_0,esk4_0))
| in(X1,esk5_0)
| in(esk4_0,esk5_0) ),
inference(spm,[status(thm)],[c_0_7,c_0_13]) ).
cnf(c_0_20,plain,
in(X1,unordered_pair(X2,X1)),
inference(er,[status(thm)],[inference(er,[status(thm)],[c_0_14])]) ).
cnf(c_0_21,plain,
( ~ in(esk2_2(X1,X2),X2)
| subset(X1,X2) ),
inference(split_conjunct,[status(thm)],[c_0_4]) ).
cnf(c_0_22,plain,
( subset(unordered_pair(X1,X2),X3)
| esk2_2(unordered_pair(X1,X2),X3) = X2
| esk2_2(unordered_pair(X1,X2),X3) = X1 ),
inference(spm,[status(thm)],[c_0_15,c_0_16]) ).
cnf(c_0_23,negated_conjecture,
( ~ in(esk4_0,esk5_0)
| ~ subset(unordered_pair(esk3_0,esk4_0),esk5_0) ),
inference(cn,[status(thm)],[inference(rw,[status(thm)],[c_0_17,c_0_18])]) ).
cnf(c_0_24,negated_conjecture,
in(esk4_0,esk5_0),
inference(spm,[status(thm)],[c_0_19,c_0_20]) ).
cnf(c_0_25,plain,
( ~ in(X2,X3)
| subset(unordered_pair(X1,X2),X3)
| esk2_2(unordered_pair(X1,X2),X3) = X1 ),
inference(spm,[status(thm)],[c_0_21,c_0_22]) ).
cnf(c_0_26,negated_conjecture,
~ subset(unordered_pair(esk3_0,esk4_0),esk5_0),
inference(cn,[status(thm)],[inference(rw,[status(thm)],[c_0_23,c_0_24])]) ).
cnf(c_0_27,plain,
( ~ in(X2,X3)
| ~ in(X1,X3)
| subset(unordered_pair(X1,X2),X3) ),
inference(spm,[status(thm)],[c_0_21,c_0_25]) ).
cnf(c_0_28,negated_conjecture,
$false,
inference(cn,[status(thm)],[inference(rw,[status(thm)],[inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_26,c_0_27]),c_0_18]),c_0_24])]),
[proof] ).
%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.00/0.03 % Problem : SEU159+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.35 % Computer : n015.cluster.edu
% 0.09/0.35 % Model : x86_64 x86_64
% 0.09/0.35 % CPU : Intel(R) Xeon(R) CPU E5-2620 v4 @ 2.10GHz
% 0.09/0.35 % Memory : 8046.5625MB
% 0.09/0.35 % OS : Linux 6.8.0-71-generic
% 0.09/0.35 % CPULimit : 300
% 0.09/0.35 % WCLimit : 300
% 0.09/0.35 % DateTime : Mon Sep 21 05:56:36 UTC 2026
% 0.09/0.36 % CPUTime :
% 0.09/0.36 Running run_E /export/starexec/sandbox2/benchmark/theBenchmark.p 300 THM
% 0.12/0.39 Running first-order theorem proving
% 0.12/0.39 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.12/0.41 % Version: 3.5.1
% 0.12/0.41 % Preprocessing class: FSSSSMSSSSSNFFN.
% 0.12/0.41 % Scheduled 4 strats onto 8 cores with 300 seconds (2400 total)
% 0.12/0.41 % Starting G-E--_302_C18_F1_URBAN_RG_S04BN with 1500s (5) cores
% 0.12/0.41 % Starting new_bool_3 with 300s (1) cores
% 0.12/0.41 % Starting new_bool_1 with 300s (1) cores
% 0.12/0.41 % Starting sh5l with 300s (1) cores
% 0.12/0.41 % G-E--_302_C18_F1_URBAN_RG_S04BN with pid 706664 completed with status 0
% 0.12/0.41 % Result found by G-E--_302_C18_F1_URBAN_RG_S04BN
% 0.12/0.41 % Preprocessing class: FSSSSMSSSSSNFFN.
% 0.12/0.41 % Scheduled 4 strats onto 8 cores with 300 seconds (2400 total)
% 0.12/0.41 % Starting G-E--_302_C18_F1_URBAN_RG_S04BN with 1500s (5) cores
% 0.12/0.41 % (lift_lambdas = 1, lambda_to_forall = 1,unroll_only_formulas = 1, sine = Auto)
% 0.12/0.41 % No SInE strategy applied
% 0.12/0.41 % Search class: FGHSS-FFSF32-SFFFFFNN
% 0.12/0.41 % Scheduled 7 strats onto 5 cores with 1500 seconds (1500 total)
% 0.12/0.41 % Starting SubtermCWHack with 136s (1) cores
% 0.12/0.41 % Starting G-E--_302_C18_F1_URBAN_RG_S04BN with 151s (1) cores
% 0.12/0.41 % Starting G-E--_208_C18_F1_SE_CS_SP_PS_S5PRR_S0Y with 136s (1) cores
% 0.12/0.41 % Starting new_bool_3 with 136s (1) cores
% 0.12/0.41 % Starting new_bool_1 with 136s (1) cores
% 0.12/0.41 % SubtermCWHack with pid 706669 completed with status 0
% 0.12/0.41 % Result found by SubtermCWHack
% 0.12/0.41 % Preprocessing class: FSSSSMSSSSSNFFN.
% 0.12/0.41 % Scheduled 4 strats onto 8 cores with 300 seconds (2400 total)
% 0.12/0.41 % Starting G-E--_302_C18_F1_URBAN_RG_S04BN with 1500s (5) cores
% 0.12/0.41 % (lift_lambdas = 1, lambda_to_forall = 1,unroll_only_formulas = 1, sine = Auto)
% 0.12/0.41 % No SInE strategy applied
% 0.12/0.41 % Search class: FGHSS-FFSF32-SFFFFFNN
% 0.12/0.41 % Scheduled 7 strats onto 5 cores with 1500 seconds (1500 total)
% 0.12/0.41 % Starting SubtermCWHack with 136s (1) cores
% 0.12/0.41 % Preprocessing time : 0.001 s
% 0.12/0.41
% 0.12/0.41 % Proof found!
% 0.12/0.41 % SZS status Theorem
% 0.12/0.41 % SZS output start CNFRefutation
% See solution above
% 0.12/0.41 % Parsed axioms : 7
% 0.12/0.41 % Removed by relevancy pruning/SinE : 0
% 0.12/0.41 % Initial clauses : 16
% 0.12/0.41 % Removed in clause preprocessing : 1
% 0.12/0.41 % Initial clauses in saturation : 15
% 0.12/0.41 % Processed clauses : 52
% 0.12/0.41 % ...of these trivial : 2
% 0.12/0.41 % ...subsumed : 14
% 0.12/0.41 % ...remaining for further processing : 36
% 0.12/0.41 % Other redundant clauses eliminated : 25
% 0.12/0.41 % Clauses deleted for lack of memory : 0
% 0.12/0.41 % Backward-subsumed : 0
% 0.12/0.41 % Backward-rewritten : 6
% 0.12/0.41 % Generated clauses : 121
% 0.12/0.41 % ...of the previous two non-redundant : 82
% 0.12/0.41 % ...aggressively subsumed : 0
% 0.12/0.41 % Contextual simplify-reflections : 0
% 0.12/0.41 % Paramodulations : 84
% 0.12/0.41 % Factorizations : 14
% 0.12/0.41 % NegExts : 0
% 0.12/0.41 % Equation resolutions : 25
% 0.12/0.41 % Disequality decompositions : 0
% 0.12/0.41 % Total rewrite steps : 24
% 0.12/0.41 % ...of those cached : 15
% 0.12/0.41 % Propositional unsat checks : 0
% 0.12/0.41 % Propositional check models : 0
% 0.12/0.41 % Propositional check unsatisfiable : 0
% 0.12/0.41 % Propositional clauses : 0
% 0.12/0.41 % Propositional clauses after purity: 0
% 0.12/0.41 % Propositional unsat core size : 0
% 0.12/0.41 % Propositional preprocessing time : 0.000
% 0.12/0.41 % Propositional encoding time : 0.000
% 0.12/0.41 % Propositional solver time : 0.000
% 0.12/0.41 % Success case prop preproc time : 0.000
% 0.12/0.41 % Success case prop encoding time : 0.000
% 0.12/0.41 % Success case prop solver time : 0.000
% 0.12/0.41 % Current number of processed clauses : 27
% 0.12/0.41 % Positive orientable unit clauses : 5
% 0.12/0.41 % Positive unorientable unit clauses: 1
% 0.12/0.41 % Negative unit clauses : 5
% 0.12/0.41 % Non-unit-clauses : 16
% 0.12/0.41 % Current number of unprocessed clauses: 41
% 0.12/0.41 % ...number of literals in the above : 166
% 0.12/0.41 % Current number of archived formulas : 0
% 0.12/0.41 % Current number of archived clauses : 6
% 0.12/0.41 % Clause-clause subsumption calls (NU) : 75
% 0.12/0.41 % Rec. Clause-clause subsumption calls : 72
% 0.12/0.41 % Non-unit clause-clause subsumptions : 9
% 0.12/0.41 % Unit Clause-clause subsumption calls : 6
% 0.12/0.41 % Rewrite failures with RHS unbound : 0
% 0.12/0.41 % BW rewrite match attempts : 3
% 0.12/0.41 % BW rewrite match successes : 2
% 0.12/0.41 % Condensation attempts : 0
% 0.12/0.41 % Condensation successes : 0
% 0.12/0.41 % Termbank termtop insertions : 2137
% 0.12/0.41 % Search garbage collected termcells : 309
% 0.12/0.41
% 0.12/0.41 % -------------------------------------------------
% 0.12/0.41 % User time : 0.008 s
% 0.12/0.41 % System time : 0.001 s
% 0.12/0.41 % Total time : 0.008 s
% 0.12/0.41 % Maximum resident set size: 3632 pages
% 0.12/0.41
% 0.12/0.41 % -------------------------------------------------
% 0.12/0.41 % User time : 0.016 s
% 0.12/0.41 % System time : 0.008 s
% 0.12/0.41 % Total time : 0.024 s
% 0.12/0.41 % Maximum resident set size: 4864 pages
% 0.12/0.41 % E exiting
%------------------------------------------------------------------------------