%------------------------------------------------------------------------------
% File : E---3.5.1
% Problem : SEV517+1 : TPTP v9.3.1. Released v7.3.0.
% Transfm : none
% Format : tptp:raw
% Command : run_E /export/starexec/sandbox2/benchmark/theBenchmark.p 300 THM
% Computer : n017.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:35:10 PM UTC 2026
% Result : Theorem 0.23s 0.58s
% Output : CNFRefutation 0.23s
% Verified :
% SZS Type : Refutation
% Derivation depth : 9
% Number of leaves : 4
% Syntax : Number of formulae : 27 ( 5 unt; 0 def)
% Number of atoms : 184 ( 13 equ)
% Maximal formula atoms : 105 ( 6 avg)
% Number of connectives : 236 ( 79 ~; 108 |; 39 &)
% ( 4 <=>; 6 =>; 0 <=; 0 <~>)
% Maximal formula depth : 39 ( 6 avg)
% Maximal term depth : 3 ( 1 avg)
% Number of predicates : 5 ( 3 usr; 1 prp; 0-2 aty)
% Number of functors : 12 ( 12 usr; 4 con; 0-3 aty)
% Number of variables : 66 ( 2 sgn 38 !; 4 ?)
% Comments :
%------------------------------------------------------------------------------
fof(diff_elem_in_partition,conjecture,
! [X3,X1,X2,X11] :
( ( partition(X11,X1)
& member(X3,difference(X1,X2)) )
=> ? [X12] :
( member(X3,X12)
& member(X12,difference(X11,singleton(X2))) ) ),
file('/export/starexec/sandbox2/benchmark/theBenchmark.p',diff_elem_in_partition) ).
fof(difference,axiom,
! [X2,X1,X4] :
( member(X2,difference(X4,X1))
<=> ( ~ member(X2,X1)
& member(X2,X4) ) ),
file('/export/starexec/sandbox2/benchmark/Axioms/SET006+0.ax',difference) ).
fof(singleton,axiom,
! [X3,X1] :
( member(X3,singleton(X1))
<=> X3 = X1 ),
file('/export/starexec/sandbox2/benchmark/Axioms/SET006+0.ax',singleton) ).
fof(partition,axiom,
! [X1,X4] :
( partition(X1,X4)
<=> ( ! [X3,X5] :
( ( member(X5,X1)
& member(X3,X1) )
=> ( ? [X6] :
( member(X6,X5)
& member(X6,X3) )
=> X3 = X5 ) )
& ! [X3] :
( member(X3,X4)
=> ? [X5] :
( member(X3,X5)
& member(X5,X1) ) )
& ! [X3] :
( member(X3,X1)
=> subset(X3,X4) ) ) ),
file('/export/starexec/sandbox2/benchmark/Axioms/SET006+2.ax',partition) ).
fof(c_0_4,negated_conjecture,
~ ! [X3,X1,X2,X11] :
( ( partition(X11,X1)
& member(X3,difference(X1,X2)) )
=> ? [X12] :
( member(X3,X12)
& member(X12,difference(X11,singleton(X2))) ) ),
inference(assume_negation,[status(cth)],[diff_elem_in_partition]) ).
fof(c_0_5,plain,
! [X2,X1,X4] :
( member(X2,difference(X4,X1))
<=> ( ~ member(X2,X1)
& member(X2,X4) ) ),
inference(fof_simplification,[status(thm)],[difference]) ).
fof(c_0_6,negated_conjecture,
! [X17] :
( ( ~ member(esk1_0,X17)
| ~ member(X17,difference(esk4_0,singleton(esk3_0))) )
& partition(esk4_0,esk2_0)
& member(esk1_0,difference(esk2_0,esk3_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_4])])])])]) ).
fof(c_0_7,plain,
! [X18,X19,X20] :
( ( member(X18,difference(X20,X19))
| member(X18,X19)
| ~ member(X18,X20) )
& ( ~ member(X18,difference(X20,X19))
| ~ member(X18,X19) )
& ( ~ member(X18,difference(X20,X19))
| member(X18,X20) ) ),
inference(distribute,[status(thm)],[inference(fof_nnf,[status(thm)],[inference(variable_rename,[status(thm)],[inference(fof_nnf,[status(thm)],[c_0_5])])])]) ).
fof(c_0_8,plain,
! [X21,X22] :
( ( member(X21,singleton(X22))
| X21 != X22 )
& ( X21 = X22
| ~ member(X21,singleton(X22)) ) ),
inference(fof_nnf,[status(thm)],[inference(variable_rename,[status(thm)],[inference(fof_nnf,[status(thm)],[singleton])])]) ).
cnf(c_0_9,negated_conjecture,
( ~ member(esk1_0,X1)
| ~ member(X1,difference(esk4_0,singleton(esk3_0))) ),
inference(split_conjunct,[status(thm)],[c_0_6]) ).
cnf(c_0_10,plain,
( ~ member(X1,X2)
| member(X1,difference(X2,X3))
| member(X1,X3) ),
inference(split_conjunct,[status(thm)],[c_0_7]) ).
cnf(c_0_11,plain,
( ~ member(X1,singleton(X2))
| X1 = X2 ),
inference(split_conjunct,[status(thm)],[c_0_8]) ).
cnf(c_0_12,negated_conjecture,
( ~ member(X1,esk4_0)
| ~ member(esk1_0,X1)
| member(X1,singleton(esk3_0)) ),
inference(spm,[status(thm)],[c_0_9,c_0_10]) ).
fof(c_0_13,plain,
! [X23,X24,X25,X26,X28,X29,X30,X31,X32,X35] :
( ( partition(X31,X32)
| ~ subset(esk6_2(X31,X32),X32)
| ~ member(esk7_2(X31,X32),X35)
| ~ member(X35,X31)
| esk8_2(X31,X32) != esk9_2(X31,X32) )
& ( partition(X31,X32)
| ~ subset(esk6_2(X31,X32),X32)
| ~ member(esk7_2(X31,X32),X35)
| ~ member(X35,X31)
| member(esk10_2(X31,X32),esk9_2(X31,X32)) )
& ( partition(X31,X32)
| ~ subset(esk6_2(X31,X32),X32)
| ~ member(esk7_2(X31,X32),X35)
| ~ member(X35,X31)
| member(esk10_2(X31,X32),esk8_2(X31,X32)) )
& ( partition(X31,X32)
| ~ subset(esk6_2(X31,X32),X32)
| ~ member(esk7_2(X31,X32),X35)
| ~ member(X35,X31)
| member(esk9_2(X31,X32),X31) )
& ( partition(X31,X32)
| ~ subset(esk6_2(X31,X32),X32)
| ~ member(esk7_2(X31,X32),X35)
| ~ member(X35,X31)
| member(esk8_2(X31,X32),X31) )
& ( partition(X31,X32)
| ~ subset(esk6_2(X31,X32),X32)
| member(esk7_2(X31,X32),X32)
| esk8_2(X31,X32) != esk9_2(X31,X32) )
& ( partition(X31,X32)
| ~ subset(esk6_2(X31,X32),X32)
| member(esk7_2(X31,X32),X32)
| member(esk10_2(X31,X32),esk9_2(X31,X32)) )
& ( partition(X31,X32)
| ~ subset(esk6_2(X31,X32),X32)
| member(esk7_2(X31,X32),X32)
| member(esk10_2(X31,X32),esk8_2(X31,X32)) )
& ( partition(X31,X32)
| ~ subset(esk6_2(X31,X32),X32)
| member(esk7_2(X31,X32),X32)
| member(esk9_2(X31,X32),X31) )
& ( partition(X31,X32)
| ~ subset(esk6_2(X31,X32),X32)
| member(esk7_2(X31,X32),X32)
| member(esk8_2(X31,X32),X31) )
& ( partition(X31,X32)
| member(esk6_2(X31,X32),X31)
| ~ member(esk7_2(X31,X32),X35)
| ~ member(X35,X31)
| esk8_2(X31,X32) != esk9_2(X31,X32) )
& ( partition(X31,X32)
| member(esk6_2(X31,X32),X31)
| ~ member(esk7_2(X31,X32),X35)
| ~ member(X35,X31)
| member(esk10_2(X31,X32),esk9_2(X31,X32)) )
& ( partition(X31,X32)
| member(esk6_2(X31,X32),X31)
| ~ member(esk7_2(X31,X32),X35)
| ~ member(X35,X31)
| member(esk10_2(X31,X32),esk8_2(X31,X32)) )
& ( partition(X31,X32)
| member(esk6_2(X31,X32),X31)
| ~ member(esk7_2(X31,X32),X35)
| ~ member(X35,X31)
| member(esk9_2(X31,X32),X31) )
& ( partition(X31,X32)
| member(esk6_2(X31,X32),X31)
| ~ member(esk7_2(X31,X32),X35)
| ~ member(X35,X31)
| member(esk8_2(X31,X32),X31) )
& ( partition(X31,X32)
| member(esk6_2(X31,X32),X31)
| member(esk7_2(X31,X32),X32)
| esk8_2(X31,X32) != esk9_2(X31,X32) )
& ( partition(X31,X32)
| member(esk6_2(X31,X32),X31)
| member(esk7_2(X31,X32),X32)
| member(esk10_2(X31,X32),esk9_2(X31,X32)) )
& ( partition(X31,X32)
| member(esk6_2(X31,X32),X31)
| member(esk7_2(X31,X32),X32)
| member(esk10_2(X31,X32),esk8_2(X31,X32)) )
& ( partition(X31,X32)
| member(esk6_2(X31,X32),X31)
| member(esk7_2(X31,X32),X32)
| member(esk9_2(X31,X32),X31) )
& ( partition(X31,X32)
| member(esk6_2(X31,X32),X31)
| member(esk7_2(X31,X32),X32)
| member(esk8_2(X31,X32),X31) )
& ( ~ partition(X23,X24)
| X28 = X29
| ~ member(X30,X29)
| ~ member(X30,X28)
| ~ member(X29,X23)
| ~ member(X28,X23) )
& ( ~ partition(X23,X24)
| ~ member(X26,X24)
| member(X26,esk5_3(X23,X24,X26)) )
& ( ~ partition(X23,X24)
| ~ member(X26,X24)
| member(esk5_3(X23,X24,X26),X23) )
& ( ~ partition(X23,X24)
| subset(X25,X24)
| ~ member(X25,X23) ) ),
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)],[partition])])])])])])]) ).
cnf(c_0_14,negated_conjecture,
( ~ member(X1,esk4_0)
| ~ member(esk1_0,X1)
| X1 = esk3_0 ),
inference(spm,[status(thm)],[c_0_11,c_0_12]) ).
cnf(c_0_15,plain,
( ~ partition(X2,X3)
| ~ member(X1,X3)
| member(X1,esk5_3(X2,X3,X1)) ),
inference(split_conjunct,[status(thm)],[c_0_13]) ).
cnf(c_0_16,negated_conjecture,
( ~ member(esk1_0,X2)
| ~ member(esk5_3(X1,X2,esk1_0),esk4_0)
| ~ partition(X1,X2)
| esk5_3(X1,X2,esk1_0) = esk3_0 ),
inference(spm,[status(thm)],[c_0_14,c_0_15]) ).
cnf(c_0_17,plain,
( ~ partition(X1,X2)
| ~ member(X3,X2)
| member(esk5_3(X1,X2,X3),X1) ),
inference(split_conjunct,[status(thm)],[c_0_13]) ).
cnf(c_0_18,plain,
( ~ member(X1,difference(X3,X2))
| ~ member(X1,X2) ),
inference(split_conjunct,[status(thm)],[c_0_7]) ).
cnf(c_0_19,negated_conjecture,
member(esk1_0,difference(esk2_0,esk3_0)),
inference(split_conjunct,[status(thm)],[c_0_6]) ).
cnf(c_0_20,negated_conjecture,
( ~ member(esk1_0,X1)
| ~ partition(esk4_0,X1)
| esk5_3(esk4_0,X1,esk1_0) = esk3_0 ),
inference(spm,[status(thm)],[c_0_16,c_0_17]) ).
cnf(c_0_21,negated_conjecture,
~ member(esk1_0,esk3_0),
inference(spm,[status(thm)],[c_0_18,c_0_19]) ).
cnf(c_0_22,plain,
( ~ member(X1,difference(X2,X3))
| member(X1,X2) ),
inference(split_conjunct,[status(thm)],[c_0_7]) ).
cnf(c_0_23,negated_conjecture,
( ~ member(esk1_0,X1)
| ~ partition(esk4_0,X1) ),
inference(sr,[status(thm)],[inference(spm,[status(thm)],[c_0_15,c_0_20]),c_0_21]) ).
cnf(c_0_24,negated_conjecture,
partition(esk4_0,esk2_0),
inference(split_conjunct,[status(thm)],[c_0_6]) ).
cnf(c_0_25,negated_conjecture,
member(esk1_0,esk2_0),
inference(spm,[status(thm)],[c_0_22,c_0_19]) ).
cnf(c_0_26,negated_conjecture,
$false,
inference(cn,[status(thm)],[inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_23,c_0_24]),c_0_25])]),
[proof] ).
%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.00/0.05 % Problem : SEV517+1 : TPTP v9.3.1. Released v7.3.0.
% 0.00/0.07 % Command : run_E /export/starexec/sandbox2/benchmark/theBenchmark.p 300 THM
% 0.19/0.45 % Computer : n017.cluster.edu
% 0.19/0.45 % Model : x86_64 x86_64
% 0.19/0.45 % CPU : Intel(R) Xeon(R) CPU E5-2620 v4 @ 2.10GHz
% 0.19/0.45 % Memory : 8046.5625MB
% 0.19/0.45 % OS : Linux 6.8.0-71-generic
% 0.19/0.45 % CPULimit : 300
% 0.19/0.45 % WCLimit : 300
% 0.19/0.45 % DateTime : Mon Sep 21 07:19:42 UTC 2026
% 0.19/0.46 % CPUTime :
% 0.19/0.46 Running run_E /export/starexec/sandbox2/benchmark/theBenchmark.p 300 THM
% 0.23/0.51 Running first-order theorem proving
% 0.23/0.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/0.58 % Version: 3.5.1
% 0.23/0.58 % Preprocessing class: FSMSSMSSSSSNFFN.
% 0.23/0.58 % Scheduled 4 strats onto 8 cores with 300 seconds (2400 total)
% 0.23/0.58 % Starting G-E--_208_C18_F1_SE_CS_SOS_SP_PS_S5PRR_RG_S04AN with 1500s (5) cores
% 0.23/0.58 % Starting new_bool_3 with 300s (1) cores
% 0.23/0.58 % Starting new_bool_1 with 300s (1) cores
% 0.23/0.58 % Starting sh5l with 300s (1) cores
% 0.23/0.58 % new_bool_3 with pid 1785248 completed with status 0
% 0.23/0.58 % Result found by new_bool_3
% 0.23/0.58 % Preprocessing class: FSMSSMSSSSSNFFN.
% 0.23/0.58 % Scheduled 4 strats onto 8 cores with 300 seconds (2400 total)
% 0.23/0.58 % Starting G-E--_208_C18_F1_SE_CS_SOS_SP_PS_S5PRR_RG_S04AN with 1500s (5) cores
% 0.23/0.58 % Starting new_bool_3 with 300s (1) cores
% 0.23/0.58 % (lift_lambdas = 0, lambda_to_forall = 0,unroll_only_formulas = 0, sine = GSinE(CountFormulas,hypos,1.5,,3,20000,1.0))
% 0.23/0.58 % SinE strategy is GSinE(CountFormulas,hypos,1.5,,3,20000,1.0)
% 0.23/0.58 % Search class: FGHSF-FFMF32-SFFFFFNN
% 0.23/0.58 % Scheduled 5 strats onto 1 cores with 300 seconds (300 total)
% 0.23/0.58 % Starting SubtermCWHack with 31s (1) cores
% 0.23/0.58 % SubtermCWHack with pid 1785251 completed with status 0
% 0.23/0.58 % Result found by SubtermCWHack
% 0.23/0.58 % Preprocessing class: FSMSSMSSSSSNFFN.
% 0.23/0.58 % Scheduled 4 strats onto 8 cores with 300 seconds (2400 total)
% 0.23/0.58 % Starting G-E--_208_C18_F1_SE_CS_SOS_SP_PS_S5PRR_RG_S04AN with 1500s (5) cores
% 0.23/0.58 % Starting new_bool_3 with 300s (1) cores
% 0.23/0.58 % (lift_lambdas = 0, lambda_to_forall = 0,unroll_only_formulas = 0, sine = GSinE(CountFormulas,hypos,1.5,,3,20000,1.0))
% 0.23/0.58 % SinE strategy is GSinE(CountFormulas,hypos,1.5,,3,20000,1.0)
% 0.23/0.58 % Search class: FGHSF-FFMF32-SFFFFFNN
% 0.23/0.58 % Scheduled 5 strats onto 1 cores with 300 seconds (300 total)
% 0.23/0.58 % Starting SubtermCWHack with 31s (1) cores
% 0.23/0.58 % Preprocessing time : 0.002 s
% 0.23/0.58
% 0.23/0.58 % Proof found!
% 0.23/0.58 % SZS status Theorem
% 0.23/0.58 % SZS output start CNFRefutation
% See solution above
% 0.23/0.58 % Parsed axioms : 20
% 0.23/0.58 % Removed by relevancy pruning/SinE : 15
% 0.23/0.58 % Initial clauses : 35
% 0.23/0.58 % Removed in clause preprocessing : 0
% 0.23/0.58 % Initial clauses in saturation : 35
% 0.23/0.58 % Processed clauses : 293
% 0.23/0.58 % ...of these trivial : 1
% 0.23/0.58 % ...subsumed : 106
% 0.23/0.58 % ...remaining for further processing : 186
% 0.23/0.58 % Other redundant clauses eliminated : 1
% 0.23/0.58 % Clauses deleted for lack of memory : 0
% 0.23/0.58 % Backward-subsumed : 5
% 0.23/0.58 % Backward-rewritten : 0
% 0.23/0.58 % Generated clauses : 1126
% 0.23/0.58 % ...of the previous two non-redundant : 1034
% 0.23/0.58 % ...aggressively subsumed : 0
% 0.23/0.58 % Contextual simplify-reflections : 5
% 0.23/0.58 % Paramodulations : 1123
% 0.23/0.58 % Factorizations : 2
% 0.23/0.58 % NegExts : 0
% 0.23/0.58 % Equation resolutions : 1
% 0.23/0.58 % Disequality decompositions : 0
% 0.23/0.58 % Total rewrite steps : 75
% 0.23/0.58 % ...of those cached : 62
% 0.23/0.58 % Propositional unsat checks : 0
% 0.23/0.58 % Propositional check models : 0
% 0.23/0.58 % Propositional check unsatisfiable : 0
% 0.23/0.58 % Propositional clauses : 0
% 0.23/0.58 % Propositional clauses after purity: 0
% 0.23/0.58 % Propositional unsat core size : 0
% 0.23/0.58 % Propositional preprocessing time : 0.000
% 0.23/0.58 % Propositional encoding time : 0.000
% 0.23/0.58 % Propositional solver time : 0.000
% 0.23/0.58 % Success case prop preproc time : 0.000
% 0.23/0.58 % Success case prop encoding time : 0.000
% 0.23/0.58 % Success case prop solver time : 0.000
% 0.23/0.58 % Current number of processed clauses : 180
% 0.23/0.58 % Positive orientable unit clauses : 15
% 0.23/0.58 % Positive unorientable unit clauses: 0
% 0.23/0.58 % Negative unit clauses : 1
% 0.23/0.58 % Non-unit-clauses : 164
% 0.23/0.58 % Current number of unprocessed clauses: 746
% 0.23/0.58 % ...number of literals in the above : 3077
% 0.23/0.58 % Current number of archived formulas : 0
% 0.23/0.58 % Current number of archived clauses : 5
% 0.23/0.58 % Clause-clause subsumption calls (NU) : 8721
% 0.23/0.58 % Rec. Clause-clause subsumption calls : 6191
% 0.23/0.58 % Non-unit clause-clause subsumptions : 106
% 0.23/0.58 % Unit Clause-clause subsumption calls : 357
% 0.23/0.58 % Rewrite failures with RHS unbound : 0
% 0.23/0.58 % BW rewrite match attempts : 10
% 0.23/0.58 % BW rewrite match successes : 0
% 0.23/0.58 % Condensation attempts : 0
% 0.23/0.58 % Condensation successes : 0
% 0.23/0.58 % Termbank termtop insertions : 20205
% 0.23/0.58 % Search garbage collected termcells : 701
% 0.23/0.58
% 0.23/0.58 % -------------------------------------------------
% 0.23/0.58 % User time : 0.034 s
% 0.23/0.58 % System time : 0.007 s
% 0.23/0.58 % Total time : 0.041 s
% 0.23/0.58 % Maximum resident set size: 3620 pages
% 0.23/0.58
% 0.23/0.58 % -------------------------------------------------
% 0.23/0.58 % User time : 0.037 s
% 0.23/0.58 % System time : 0.013 s
% 0.23/0.58 % Total time : 0.050 s
% 0.23/0.58 % Maximum resident set size: 4608 pages
% 0.23/0.58 % E exiting
%------------------------------------------------------------------------------