%------------------------------------------------------------------------------
% File : E---3.5.1
% Problem : SWC010+1 : TPTP v9.3.1. Released v2.4.0.
% Transfm : none
% Format : tptp:raw
% Command : run_E /export/starexec/sandbox/benchmark/theBenchmark.p 300 THM
% Computer : n008.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:42:36 PM UTC 2026
% Result : Theorem 0.10s 0.45s
% Output : CNFRefutation 0.10s
% Verified :
% SZS Type : Refutation
% Derivation depth : 8
% Number of leaves : 1
% Syntax : Number of formulae : 22 ( 10 unt; 0 def)
% Number of atoms : 154 ( 43 equ)
% Maximal formula atoms : 52 ( 7 avg)
% Number of connectives : 195 ( 63 ~; 66 |; 45 &)
% ( 0 <=>; 21 =>; 0 <=; 0 <~>)
% Maximal formula depth : 31 ( 7 avg)
% Maximal term depth : 4 ( 1 avg)
% Number of predicates : 7 ( 5 usr; 1 prp; 0-2 aty)
% Number of functors : 10 ( 10 usr; 8 con; 0-2 aty)
% Number of variables : 43 ( 0 sgn 25 !; 12 ?)
% Comments :
%------------------------------------------------------------------------------
fof(co1,conjecture,
! [X1] :
( ssList(X1)
=> ! [X2] :
( ssList(X2)
=> ! [X3] :
( ssList(X3)
=> ! [X4] :
( ssList(X4)
=> ( ( ( neq(X4,nil)
| ~ neq(X2,nil) )
& ( ! [X8] :
( ssItem(X8)
=> ! [X9] :
( ssList(X9)
=> ! [X10] :
( ssList(X10)
=> ( ? [X11] :
( geq(X11,X8)
& memberP(X4,X11)
& X8 != X11
& ssItem(X11) )
| app(X9,X10) != X3
| app(app(X9,cons(X8,nil)),X10) != X4 ) ) ) )
| ? [X5] :
( ? [X6] :
( ? [X7] :
( app(X6,X7) = X1
& app(app(X6,cons(X5,nil)),X7) = X2
& ssList(X7) )
& ssList(X6) )
& ssItem(X5) )
| ~ neq(X2,nil) ) )
| X1 != X3
| X2 != X4 ) ) ) ) ),
file('/export/starexec/sandbox/benchmark/theBenchmark.p',co1) ).
fof(c_0_1,negated_conjecture,
~ ! [X1] :
( ssList(X1)
=> ! [X2] :
( ssList(X2)
=> ! [X3] :
( ssList(X3)
=> ! [X4] :
( ssList(X4)
=> ( ( ( neq(X4,nil)
| ~ neq(X2,nil) )
& ( ! [X8] :
( ssItem(X8)
=> ! [X9] :
( ssList(X9)
=> ! [X10] :
( ssList(X10)
=> ( ? [X11] :
( geq(X11,X8)
& memberP(X4,X11)
& X8 != X11
& ssItem(X11) )
| app(X9,X10) != X3
| app(app(X9,cons(X8,nil)),X10) != X4 ) ) ) )
| ? [X5] :
( ? [X6] :
( ? [X7] :
( app(X6,X7) = X1
& app(app(X6,cons(X5,nil)),X7) = X2
& ssList(X7) )
& ssList(X6) )
& ssItem(X5) )
| ~ neq(X2,nil) ) )
| 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)
=> ( ( ( neq(X4,nil)
| ~ neq(X2,nil) )
& ( ! [X8] :
( ssItem(X8)
=> ! [X9] :
( ssList(X9)
=> ! [X10] :
( ssList(X10)
=> ( ? [X11] :
( geq(X11,X8)
& memberP(X4,X11)
& X8 != X11
& ssItem(X11) )
| app(X9,X10) != X3
| app(app(X9,cons(X8,nil)),X10) != X4 ) ) ) )
| ? [X5] :
( ? [X6] :
( ? [X7] :
( app(X6,X7) = X1
& app(app(X6,cons(X5,nil)),X7) = X2
& ssList(X7) )
& ssList(X6) )
& ssItem(X5) )
| ~ neq(X2,nil) ) )
| X1 != X3
| X2 != X4 ) ) ) ) ),
inference(fof_simplification,[status(thm)],[c_0_1]) ).
fof(c_0_3,negated_conjecture,
! [X16,X17,X18,X22] :
( ( ~ geq(X22,esk5_0)
| ~ memberP(esk4_0,X22)
| esk5_0 = X22
| ~ ssItem(X22)
| ~ neq(esk4_0,nil) )
& ( ~ geq(X22,esk5_0)
| ~ memberP(esk4_0,X22)
| esk5_0 = X22
| ~ ssItem(X22)
| neq(esk2_0,nil) )
& ( app(esk6_0,esk7_0) = esk3_0
| ~ neq(esk4_0,nil) )
& ( app(esk6_0,esk7_0) = esk3_0
| neq(esk2_0,nil) )
& ( app(app(esk6_0,cons(esk5_0,nil)),esk7_0) = esk4_0
| ~ neq(esk4_0,nil) )
& ( app(app(esk6_0,cons(esk5_0,nil)),esk7_0) = esk4_0
| neq(esk2_0,nil) )
& ( ssList(esk7_0)
| ~ neq(esk4_0,nil) )
& ( ssList(esk7_0)
| neq(esk2_0,nil) )
& ( ssList(esk6_0)
| ~ neq(esk4_0,nil) )
& ( ssList(esk6_0)
| neq(esk2_0,nil) )
& ( ssItem(esk5_0)
| ~ neq(esk4_0,nil) )
& ( ssItem(esk5_0)
| neq(esk2_0,nil) )
& ( app(X17,X18) != esk1_0
| app(app(X17,cons(X16,nil)),X18) != esk2_0
| ~ ssList(X18)
| ~ ssList(X17)
| ~ ssItem(X16)
| ~ neq(esk4_0,nil) )
& ( app(X17,X18) != esk1_0
| app(app(X17,cons(X16,nil)),X18) != esk2_0
| ~ ssList(X18)
| ~ ssList(X17)
| ~ ssItem(X16)
| neq(esk2_0,nil) )
& ( neq(esk2_0,nil)
| ~ neq(esk4_0,nil) )
& ( neq(esk2_0,nil)
| neq(esk2_0,nil) )
& 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,
( neq(esk2_0,nil)
| neq(esk2_0,nil) ),
inference(split_conjunct,[status(thm)],[c_0_3]) ).
cnf(c_0_5,negated_conjecture,
neq(esk2_0,nil),
inference(cn,[status(thm)],[c_0_4]) ).
cnf(c_0_6,negated_conjecture,
esk2_0 = esk4_0,
inference(split_conjunct,[status(thm)],[c_0_3]) ).
cnf(c_0_7,negated_conjecture,
( app(X2,X3) != esk1_0
| app(app(X2,cons(X1,nil)),X3) != esk2_0
| ~ ssList(X3)
| ~ ssList(X2)
| ~ ssItem(X1)
| ~ neq(esk4_0,nil) ),
inference(split_conjunct,[status(thm)],[c_0_3]) ).
cnf(c_0_8,negated_conjecture,
neq(esk4_0,nil),
inference(rw,[status(thm)],[c_0_5,c_0_6]) ).
cnf(c_0_9,negated_conjecture,
( ~ neq(esk4_0,nil)
| app(app(esk6_0,cons(esk5_0,nil)),esk7_0) = esk4_0 ),
inference(split_conjunct,[status(thm)],[c_0_3]) ).
cnf(c_0_10,negated_conjecture,
( ~ neq(esk4_0,nil)
| app(esk6_0,esk7_0) = esk3_0 ),
inference(split_conjunct,[status(thm)],[c_0_3]) ).
cnf(c_0_11,negated_conjecture,
esk1_0 = esk3_0,
inference(split_conjunct,[status(thm)],[c_0_3]) ).
cnf(c_0_12,negated_conjecture,
( ~ neq(esk4_0,nil)
| ssList(esk7_0) ),
inference(split_conjunct,[status(thm)],[c_0_3]) ).
cnf(c_0_13,negated_conjecture,
( ~ neq(esk4_0,nil)
| ssList(esk6_0) ),
inference(split_conjunct,[status(thm)],[c_0_3]) ).
cnf(c_0_14,negated_conjecture,
( ~ neq(esk4_0,nil)
| ssItem(esk5_0) ),
inference(split_conjunct,[status(thm)],[c_0_3]) ).
cnf(c_0_15,negated_conjecture,
( ~ ssItem(X2)
| ~ ssList(X1)
| ~ ssList(X3)
| app(X1,X3) != esk1_0
| app(app(X1,cons(X2,nil)),X3) != esk4_0 ),
inference(cn,[status(thm)],[inference(rw,[status(thm)],[inference(rw,[status(thm)],[c_0_7,c_0_6]),c_0_8])]) ).
cnf(c_0_16,negated_conjecture,
app(app(esk6_0,cons(esk5_0,nil)),esk7_0) = esk4_0,
inference(cn,[status(thm)],[inference(rw,[status(thm)],[c_0_9,c_0_8])]) ).
cnf(c_0_17,negated_conjecture,
app(esk6_0,esk7_0) = esk1_0,
inference(cn,[status(thm)],[inference(rw,[status(thm)],[inference(rw,[status(thm)],[c_0_10,c_0_11]),c_0_8])]) ).
cnf(c_0_18,negated_conjecture,
ssList(esk7_0),
inference(cn,[status(thm)],[inference(rw,[status(thm)],[c_0_12,c_0_8])]) ).
cnf(c_0_19,negated_conjecture,
ssList(esk6_0),
inference(cn,[status(thm)],[inference(rw,[status(thm)],[c_0_13,c_0_8])]) ).
cnf(c_0_20,negated_conjecture,
ssItem(esk5_0),
inference(cn,[status(thm)],[inference(rw,[status(thm)],[c_0_14,c_0_8])]) ).
cnf(c_0_21,negated_conjecture,
$false,
inference(cn,[status(thm)],[inference(rw,[status(thm)],[inference(rw,[status(thm)],[inference(rw,[status(thm)],[inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_15,c_0_16]),c_0_17]),c_0_18]),c_0_19]),c_0_20])]),
[proof] ).
%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.00/0.03 % Problem : SWC010+1 : TPTP v9.3.1. Released v2.4.0.
% 0.00/0.05 % Command : run_E /export/starexec/sandbox/benchmark/theBenchmark.p 300 THM
% 0.10/0.36 % Computer : n008.cluster.edu
% 0.10/0.36 % Model : x86_64 x86_64
% 0.10/0.36 % CPU : Intel(R) Xeon(R) CPU E5-2620 v4 @ 2.10GHz
% 0.10/0.36 % Memory : 8046.5625MB
% 0.10/0.36 % OS : Linux 6.8.0-71-generic
% 0.10/0.36 % CPULimit : 300
% 0.10/0.36 % WCLimit : 300
% 0.10/0.36 % DateTime : Mon Sep 21 07:49:54 UTC 2026
% 0.10/0.37 % CPUTime :
% 0.10/0.37 Running run_E /export/starexec/sandbox/benchmark/theBenchmark.p 300 THM
% 0.10/0.41 Running first-order theorem proving
% 0.10/0.41 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.10/0.45 % Version: 3.5.1
% 0.10/0.45 % Preprocessing class: FSLSSMSSSSSNFFN.
% 0.10/0.45 % Scheduled 4 strats onto 8 cores with 300 seconds (2400 total)
% 0.10/0.45 % Starting G-E--_207_C18_F1_SE_CS_SP_PI_PS_S5PRR_S2S with 1500s (5) cores
% 0.10/0.45 % Starting new_bool_3 with 300s (1) cores
% 0.10/0.45 % Starting new_bool_1 with 300s (1) cores
% 0.10/0.45 % Starting sh5l with 300s (1) cores
% 0.10/0.45 % new_bool_1 with pid 516297 completed with status 0
% 0.10/0.45 % Result found by new_bool_1
% 0.10/0.45 % Preprocessing class: FSLSSMSSSSSNFFN.
% 0.10/0.45 % Scheduled 4 strats onto 8 cores with 300 seconds (2400 total)
% 0.10/0.45 % Starting G-E--_207_C18_F1_SE_CS_SP_PI_PS_S5PRR_S2S with 1500s (5) cores
% 0.10/0.45 % Starting new_bool_3 with 300s (1) cores
% 0.10/0.45 % Starting new_bool_1 with 300s (1) cores
% 0.10/0.45 % (lift_lambdas = 0, lambda_to_forall = 0,unroll_only_formulas = 0, sine = GSinE(CountFormulas,hypos,1.5,,3,20000,1.0))
% 0.10/0.45 % SinE strategy is GSinE(CountFormulas,hypos,1.5,,3,20000,1.0)
% 0.10/0.45 % Search class: FGHSF-FFMM21-MFFFFFNN
% 0.10/0.45 % Scheduled 5 strats onto 1 cores with 300 seconds (300 total)
% 0.10/0.45 % Starting SubtermCWHack with 31s (1) cores
% 0.10/0.45 % SubtermCWHack with pid 516300 completed with status 0
% 0.10/0.45 % Result found by SubtermCWHack
% 0.10/0.45 % Preprocessing class: FSLSSMSSSSSNFFN.
% 0.10/0.45 % Scheduled 4 strats onto 8 cores with 300 seconds (2400 total)
% 0.10/0.45 % Starting G-E--_207_C18_F1_SE_CS_SP_PI_PS_S5PRR_S2S with 1500s (5) cores
% 0.10/0.45 % Starting new_bool_3 with 300s (1) cores
% 0.10/0.45 % Starting new_bool_1 with 300s (1) cores
% 0.10/0.45 % (lift_lambdas = 0, lambda_to_forall = 0,unroll_only_formulas = 0, sine = GSinE(CountFormulas,hypos,1.5,,3,20000,1.0))
% 0.10/0.45 % SinE strategy is GSinE(CountFormulas,hypos,1.5,,3,20000,1.0)
% 0.10/0.45 % Search class: FGHSF-FFMM21-MFFFFFNN
% 0.10/0.45 % Scheduled 5 strats onto 1 cores with 300 seconds (300 total)
% 0.10/0.45 % Starting SubtermCWHack with 31s (1) cores
% 0.10/0.45 % Preprocessing time : 0.002 s
% 0.10/0.45
% 0.10/0.45 % Proof found!
% 0.10/0.45 % SZS status Theorem
% 0.10/0.45 % SZS output start CNFRefutation
% See solution above
% 0.10/0.45 % Parsed axioms : 96
% 0.10/0.45 % Removed by relevancy pruning/SinE : 60
% 0.10/0.45 % Initial clauses : 76
% 0.10/0.45 % Removed in clause preprocessing : 0
% 0.10/0.45 % Initial clauses in saturation : 76
% 0.10/0.45 % Processed clauses : 220
% 0.10/0.45 % ...of these trivial : 9
% 0.10/0.45 % ...subsumed : 85
% 0.10/0.45 % ...remaining for further processing : 126
% 0.10/0.45 % Other redundant clauses eliminated : 18
% 0.10/0.45 % Clauses deleted for lack of memory : 0
% 0.10/0.45 % Backward-subsumed : 5
% 0.10/0.45 % Backward-rewritten : 2
% 0.10/0.45 % Generated clauses : 509
% 0.10/0.45 % ...of the previous two non-redundant : 387
% 0.10/0.45 % ...aggressively subsumed : 0
% 0.10/0.45 % Contextual simplify-reflections : 5
% 0.10/0.45 % Paramodulations : 488
% 0.10/0.45 % Factorizations : 0
% 0.10/0.45 % NegExts : 0
% 0.10/0.45 % Equation resolutions : 22
% 0.10/0.45 % Disequality decompositions : 0
% 0.10/0.45 % Total rewrite steps : 483
% 0.10/0.45 % ...of those cached : 471
% 0.10/0.45 % Propositional unsat checks : 0
% 0.10/0.45 % Propositional check models : 0
% 0.10/0.45 % Propositional check unsatisfiable : 0
% 0.10/0.45 % Propositional clauses : 0
% 0.10/0.45 % Propositional clauses after purity: 0
% 0.10/0.45 % Propositional unsat core size : 0
% 0.10/0.45 % Propositional preprocessing time : 0.000
% 0.10/0.45 % Propositional encoding time : 0.000
% 0.10/0.45 % Propositional solver time : 0.000
% 0.10/0.45 % Success case prop preproc time : 0.000
% 0.10/0.45 % Success case prop encoding time : 0.000
% 0.10/0.45 % Success case prop solver time : 0.000
% 0.10/0.45 % Current number of processed clauses : 113
% 0.10/0.45 % Positive orientable unit clauses : 15
% 0.10/0.45 % Positive unorientable unit clauses: 0
% 0.10/0.45 % Negative unit clauses : 1
% 0.10/0.45 % Non-unit-clauses : 97
% 0.10/0.45 % Current number of unprocessed clauses: 238
% 0.10/0.45 % ...number of literals in the above : 1110
% 0.10/0.45 % Current number of archived formulas : 0
% 0.10/0.45 % Current number of archived clauses : 7
% 0.10/0.45 % Clause-clause subsumption calls (NU) : 1489
% 0.10/0.45 % Rec. Clause-clause subsumption calls : 736
% 0.10/0.45 % Non-unit clause-clause subsumptions : 95
% 0.10/0.45 % Unit Clause-clause subsumption calls : 1
% 0.10/0.45 % Rewrite failures with RHS unbound : 0
% 0.10/0.45 % BW rewrite match attempts : 2
% 0.10/0.45 % BW rewrite match successes : 2
% 0.10/0.45 % Condensation attempts : 0
% 0.10/0.45 % Condensation successes : 0
% 0.10/0.45 % Termbank termtop insertions : 14490
% 0.10/0.45 % Search garbage collected termcells : 2023
% 0.10/0.45
% 0.10/0.45 % -------------------------------------------------
% 0.10/0.45 % User time : 0.023 s
% 0.10/0.45 % System time : 0.002 s
% 0.10/0.45 % Total time : 0.025 s
% 0.10/0.45 % Maximum resident set size: 3764 pages
% 0.10/0.45
% 0.10/0.45 % -------------------------------------------------
% 0.10/0.45 % User time : 0.028 s
% 0.10/0.45 % System time : 0.006 s
% 0.10/0.45 % Total time : 0.034 s
% 0.10/0.45 % Maximum resident set size: 4864 pages
% 0.10/0.45 % E exiting
%------------------------------------------------------------------------------