%------------------------------------------------------------------------------
% File : E---3.5.1
% Problem : SWC406+1 : TPTP v9.3.1. Released v2.4.0.
% Transfm : none
% Format : tptp:raw
% Command : run_E /export/starexec/sandbox2/benchmark/theBenchmark.p 300 THM
% Computer : n010.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:44:17 PM UTC 2026
% Result : Theorem 0.13s 10.67s
% Output : CNFRefutation 0.13s
% Verified :
% SZS Type : Refutation
% Derivation depth : 6
% Number of leaves : 1
% Syntax : Number of formulae : 13 ( 8 unt; 0 def)
% Number of atoms : 111 ( 18 equ)
% Maximal formula atoms : 34 ( 8 avg)
% Number of connectives : 145 ( 47 ~; 45 |; 35 &)
% ( 0 <=>; 18 =>; 0 <=; 0 <~>)
% Maximal formula depth : 23 ( 8 avg)
% Maximal term depth : 2 ( 1 avg)
% Number of predicates : 6 ( 4 usr; 1 prp; 0-2 aty)
% Number of functors : 6 ( 6 usr; 5 con; 0-1 aty)
% Number of variables : 27 ( 0 sgn 20 !; 6 ?)
% Comments :
%------------------------------------------------------------------------------
fof(co1,conjecture,
! [X1] :
( ssList(X1)
=> ! [X2] :
( ssList(X2)
=> ! [X3] :
( ssList(X3)
=> ! [X4] :
( ssList(X4)
=> ( ! [X7] :
( ssItem(X7)
=> ( memberP(X2,X7)
| ~ memberP(X1,X7) ) )
| ? [X5] :
( ( ( ( ? [X6] :
( leq(X6,X5)
& memberP(X4,X6)
& X5 != X6
& ssItem(X6) )
| ~ memberP(X4,X5) )
& memberP(X3,X5) )
| ( memberP(X4,X5)
& ! [X6] :
( ssItem(X6)
=> ( X5 = X6
| ~ leq(X6,X5)
| ~ memberP(X4,X6) ) )
& ~ memberP(X3,X5) ) )
& ssItem(X5) )
| X1 != X3
| X2 != X4 ) ) ) ) ),
file('/export/starexec/sandbox2/benchmark/theBenchmark.p',co1) ).
fof(c_0_1,negated_conjecture,
~ ! [X1] :
( ssList(X1)
=> ! [X2] :
( ssList(X2)
=> ! [X3] :
( ssList(X3)
=> ! [X4] :
( ssList(X4)
=> ( ! [X7] :
( ssItem(X7)
=> ( memberP(X2,X7)
| ~ memberP(X1,X7) ) )
| ? [X5] :
( ( ( ( ? [X6] :
( leq(X6,X5)
& memberP(X4,X6)
& X5 != X6
& ssItem(X6) )
| ~ memberP(X4,X5) )
& memberP(X3,X5) )
| ( memberP(X4,X5)
& ! [X6] :
( ssItem(X6)
=> ( X5 = X6
| ~ leq(X6,X5)
| ~ memberP(X4,X6) ) )
& ~ memberP(X3,X5) ) )
& ssItem(X5) )
| X1 != X3
| X2 != X4 ) ) ) ) ),
inference(assume_negation,[status(cth)],[co1]) ).
fof(c_0_2,negated_conjecture,
~ ! [X1] :
( ssList(X1)
=> ! [X2] :
( ssList(X2)
=> ! [X3] :
( ssList(X3)
=> ! [X4] :
( ssList(X4)
=> ( ! [X7] :
( ssItem(X7)
=> ( memberP(X2,X7)
| ~ memberP(X1,X7) ) )
| ? [X5] :
( ( ( ( ? [X6] :
( leq(X6,X5)
& memberP(X4,X6)
& X5 != X6
& ssItem(X6) )
| ~ memberP(X4,X5) )
& memberP(X3,X5) )
| ( memberP(X4,X5)
& ! [X6] :
( ssItem(X6)
=> ( X5 = X6
| ~ leq(X6,X5)
| ~ memberP(X4,X6) ) )
& ~ memberP(X3,X5) ) )
& ssItem(X5) )
| X1 != X3
| X2 != X4 ) ) ) ) ),
inference(fof_simplification,[status(thm)],[c_0_1]) ).
fof(c_0_3,negated_conjecture,
! [X12,X14] :
( ~ memberP(esk2_0,esk6_0)
& memberP(esk1_0,esk6_0)
& ssItem(esk6_0)
& ( ~ ssItem(X12)
| ~ memberP(esk3_0,X12)
| ~ leq(X14,X12)
| ~ memberP(esk4_0,X14)
| X12 = X14
| ~ ssItem(X14) )
& ( ~ ssItem(X12)
| ~ memberP(esk3_0,X12)
| memberP(esk4_0,X12) )
& ( ~ ssItem(X12)
| ~ memberP(esk4_0,X12)
| memberP(esk3_0,X12)
| X12 != esk5_1(X12) )
& ( ~ ssItem(X12)
| ~ memberP(esk4_0,X12)
| memberP(esk3_0,X12)
| leq(esk5_1(X12),X12) )
& ( ~ ssItem(X12)
| ~ memberP(esk4_0,X12)
| memberP(esk3_0,X12)
| memberP(esk4_0,esk5_1(X12)) )
& ( ~ ssItem(X12)
| ~ memberP(esk4_0,X12)
| memberP(esk3_0,X12)
| ssItem(esk5_1(X12)) )
& esk1_0 = esk3_0
& esk2_0 = esk4_0
& ssList(esk4_0)
& ssList(esk3_0)
& ssList(esk2_0)
& ssList(esk1_0) ),
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)],[c_0_2])])])])])]) ).
cnf(c_0_4,negated_conjecture,
memberP(esk1_0,esk6_0),
inference(split_conjunct,[status(thm)],[c_0_3]) ).
cnf(c_0_5,negated_conjecture,
esk1_0 = esk3_0,
inference(split_conjunct,[status(thm)],[c_0_3]) ).
cnf(c_0_6,negated_conjecture,
~ memberP(esk2_0,esk6_0),
inference(split_conjunct,[status(thm)],[c_0_3]) ).
cnf(c_0_7,negated_conjecture,
esk2_0 = esk4_0,
inference(split_conjunct,[status(thm)],[c_0_3]) ).
cnf(c_0_8,negated_conjecture,
( ~ ssItem(X1)
| ~ memberP(esk3_0,X1)
| memberP(esk4_0,X1) ),
inference(split_conjunct,[status(thm)],[c_0_3]) ).
cnf(c_0_9,negated_conjecture,
memberP(esk3_0,esk6_0),
inference(rw,[status(thm)],[c_0_4,c_0_5]) ).
cnf(c_0_10,negated_conjecture,
ssItem(esk6_0),
inference(split_conjunct,[status(thm)],[c_0_3]) ).
cnf(c_0_11,negated_conjecture,
~ memberP(esk4_0,esk6_0),
inference(rw,[status(thm)],[c_0_6,c_0_7]) ).
cnf(c_0_12,negated_conjecture,
$false,
inference(sr,[status(thm)],[inference(cn,[status(thm)],[inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_8,c_0_9]),c_0_10])]),c_0_11]),
[proof] ).
%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.00/0.02 % Problem : SWC406+1 : TPTP v9.3.1. Released v2.4.0.
% 0.00/0.05 % Command : run_E /export/starexec/sandbox2/benchmark/theBenchmark.p 300 THM
% 0.13/10.60 % Computer : n010.cluster.edu
% 0.13/10.60 % Model : x86_64 x86_64
% 0.13/10.60 % CPU : Intel(R) Xeon(R) CPU E5-2620 v4 @ 2.10GHz
% 0.13/10.60 % Memory : 8046.5625MB
% 0.13/10.60 % OS : Linux 6.8.0-71-generic
% 0.13/10.60 % CPULimit : 300
% 0.13/10.60 % WCLimit : 300
% 0.13/10.60 % DateTime : Mon Sep 21 08:22:52 UTC 2026
% 0.13/10.60 % CPUTime :
% 0.13/10.60 Running run_E /export/starexec/sandbox2/benchmark/theBenchmark.p 300 THM
% 0.13/10.64 Running first-order theorem proving
% 0.13/10.64 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.13/10.67 % Version: 3.5.1
% 0.13/10.67 % Preprocessing class: FSLSSMSSSSSNFFN.
% 0.13/10.67 % Scheduled 4 strats onto 8 cores with 300 seconds (2400 total)
% 0.13/10.67 % Starting G-E--_207_C18_F1_SE_CS_SP_PI_PS_S5PRR_S2S with 1500s (5) cores
% 0.13/10.67 % Starting new_bool_3 with 300s (1) cores
% 0.13/10.67 % Starting new_bool_1 with 300s (1) cores
% 0.13/10.67 % Starting sh5l with 300s (1) cores
% 0.13/10.67 % new_bool_3 with pid 462531 completed with status 0
% 0.13/10.67 % Result found by new_bool_3
% 0.13/10.67 % Preprocessing class: FSLSSMSSSSSNFFN.
% 0.13/10.67 % Scheduled 4 strats onto 8 cores with 300 seconds (2400 total)
% 0.13/10.67 % Starting G-E--_207_C18_F1_SE_CS_SP_PI_PS_S5PRR_S2S with 1500s (5) cores
% 0.13/10.67 % Starting new_bool_3 with 300s (1) cores
% 0.13/10.67 % (lift_lambdas = 0, lambda_to_forall = 0,unroll_only_formulas = 0, sine = GSinE(CountFormulas,hypos,1.5,,3,20000,1.0))
% 0.13/10.67 % SinE strategy is GSinE(CountFormulas,hypos,1.5,,3,20000,1.0)
% 0.13/10.67 % Search class: FGHSF-FFMM21-MFFFFFNN
% 0.13/10.67 % Scheduled 5 strats onto 1 cores with 300 seconds (300 total)
% 0.13/10.67 % Starting SubtermCWHack with 31s (1) cores
% 0.13/10.67 % SubtermCWHack with pid 462537 completed with status 0
% 0.13/10.67 % Result found by SubtermCWHack
% 0.13/10.67 % Preprocessing class: FSLSSMSSSSSNFFN.
% 0.13/10.67 % Scheduled 4 strats onto 8 cores with 300 seconds (2400 total)
% 0.13/10.67 % Starting G-E--_207_C18_F1_SE_CS_SP_PI_PS_S5PRR_S2S with 1500s (5) cores
% 0.13/10.67 % Starting new_bool_3 with 300s (1) cores
% 0.13/10.67 % (lift_lambdas = 0, lambda_to_forall = 0,unroll_only_formulas = 0, sine = GSinE(CountFormulas,hypos,1.5,,3,20000,1.0))
% 0.13/10.67 % SinE strategy is GSinE(CountFormulas,hypos,1.5,,3,20000,1.0)
% 0.13/10.67 % Search class: FGHSF-FFMM21-MFFFFFNN
% 0.13/10.67 % Scheduled 5 strats onto 1 cores with 300 seconds (300 total)
% 0.13/10.67 % Starting SubtermCWHack with 31s (1) cores
% 0.13/10.67 % Preprocessing time : 0.002 s
% 0.13/10.67
% 0.13/10.67 % Proof found!
% 0.13/10.67 % SZS status Theorem
% 0.13/10.67 % SZS output start CNFRefutation
% See solution above
% 0.13/10.67 % Parsed axioms : 96
% 0.13/10.67 % Removed by relevancy pruning/SinE : 66
% 0.13/10.67 % Initial clauses : 60
% 0.13/10.67 % Removed in clause preprocessing : 0
% 0.13/10.67 % Initial clauses in saturation : 60
% 0.13/10.67 % Processed clauses : 21
% 0.13/10.67 % ...of these trivial : 0
% 0.13/10.67 % ...subsumed : 0
% 0.13/10.67 % ...remaining for further processing : 21
% 0.13/10.67 % Other redundant clauses eliminated : 0
% 0.13/10.67 % Clauses deleted for lack of memory : 0
% 0.13/10.67 % Backward-subsumed : 0
% 0.13/10.67 % Backward-rewritten : 2
% 0.13/10.67 % Generated clauses : 1
% 0.13/10.67 % ...of the previous two non-redundant : 0
% 0.13/10.67 % ...aggressively subsumed : 0
% 0.13/10.67 % Contextual simplify-reflections : 0
% 0.13/10.67 % Paramodulations : 1
% 0.13/10.67 % Factorizations : 0
% 0.13/10.67 % NegExts : 0
% 0.13/10.67 % Equation resolutions : 0
% 0.13/10.67 % Disequality decompositions : 0
% 0.13/10.67 % Total rewrite steps : 7
% 0.13/10.67 % ...of those cached : 2
% 0.13/10.67 % Propositional unsat checks : 0
% 0.13/10.67 % Propositional check models : 0
% 0.13/10.67 % Propositional check unsatisfiable : 0
% 0.13/10.67 % Propositional clauses : 0
% 0.13/10.67 % Propositional clauses after purity: 0
% 0.13/10.67 % Propositional unsat core size : 0
% 0.13/10.67 % Propositional preprocessing time : 0.000
% 0.13/10.67 % Propositional encoding time : 0.000
% 0.13/10.67 % Propositional solver time : 0.000
% 0.13/10.67 % Success case prop preproc time : 0.000
% 0.13/10.67 % Success case prop encoding time : 0.000
% 0.13/10.67 % Success case prop solver time : 0.000
% 0.13/10.67 % Current number of processed clauses : 19
% 0.13/10.67 % Positive orientable unit clauses : 9
% 0.13/10.67 % Positive unorientable unit clauses: 0
% 0.13/10.67 % Negative unit clauses : 2
% 0.13/10.67 % Non-unit-clauses : 8
% 0.13/10.67 % Current number of unprocessed clauses: 39
% 0.13/10.67 % ...number of literals in the above : 178
% 0.13/10.67 % Current number of archived formulas : 0
% 0.13/10.67 % Current number of archived clauses : 2
% 0.13/10.67 % Clause-clause subsumption calls (NU) : 4
% 0.13/10.67 % Rec. Clause-clause subsumption calls : 4
% 0.13/10.67 % Non-unit clause-clause subsumptions : 0
% 0.13/10.67 % Unit Clause-clause subsumption calls : 0
% 0.13/10.67 % Rewrite failures with RHS unbound : 0
% 0.13/10.67 % BW rewrite match attempts : 2
% 0.13/10.67 % BW rewrite match successes : 2
% 0.13/10.67 % Condensation attempts : 0
% 0.13/10.67 % Condensation successes : 0
% 0.13/10.67 % Termbank termtop insertions : 5914
% 0.13/10.67 % Search garbage collected termcells : 1828
% 0.13/10.67
% 0.13/10.67 % -------------------------------------------------
% 0.13/10.67 % User time : 0.009 s
% 0.13/10.67 % System time : 0.002 s
% 0.13/10.67 % Total time : 0.011 s
% 0.13/10.67 % Maximum resident set size: 3760 pages
% 0.13/10.67
% 0.13/10.67 % -------------------------------------------------
% 0.13/10.67 % User time : 0.013 s
% 0.13/10.67 % System time : 0.006 s
% 0.13/10.67 % Total time : 0.020 s
% 0.13/10.67 % Maximum resident set size: 4864 pages
% 0.13/10.67 % E exiting
%------------------------------------------------------------------------------