%------------------------------------------------------------------------------
% File : E---3.5.1
% Problem : SWC309+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 : n026.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:43:52 PM UTC 2026
% Result : Theorem 0.39s 0.63s
% Output : CNFRefutation 0.39s
% Verified :
% SZS Type : Refutation
% Derivation depth : 11
% Number of leaves : 5
% Syntax : Number of formulae : 33 ( 10 unt; 0 def)
% Number of atoms : 151 ( 61 equ)
% Maximal formula atoms : 17 ( 4 avg)
% Number of connectives : 183 ( 65 ~; 62 |; 35 &)
% ( 2 <=>; 19 =>; 0 <=; 0 <~>)
% Maximal formula depth : 21 ( 6 avg)
% Maximal term depth : 3 ( 1 avg)
% Number of predicates : 5 ( 3 usr; 1 prp; 0-2 aty)
% Number of functors : 9 ( 9 usr; 5 con; 0-2 aty)
% Number of variables : 58 ( 0 sgn 28 !; 14 ?)
% Comments :
%------------------------------------------------------------------------------
fof(co1,conjecture,
! [X1] :
( ssList(X1)
=> ! [X2] :
( ssList(X2)
=> ! [X3] :
( ssList(X3)
=> ! [X4] :
( ssList(X4)
=> ( ( nil = X4
& nil != X3 )
| ? [X7] :
( ? [X8] :
( app(cons(X7,nil),X8) = X4
& app(X8,cons(X7,nil)) != X3
& ssList(X8) )
& ssItem(X7) )
| ? [X5] :
( ? [X6] :
( app(X6,cons(X5,nil)) = X1
& app(cons(X5,nil),X6) = X2
& ssList(X6) )
& ssItem(X5) )
| ~ neq(X2,nil)
| X1 != X3
| X2 != X4 ) ) ) ) ),
file('/export/starexec/sandbox/benchmark/theBenchmark.p',co1) ).
fof(ax81,axiom,
! [X1] :
( ssList(X1)
=> ! [X2] :
( ssItem(X2)
=> cons(X2,X1) = app(cons(X2,nil),X1) ) ),
file('/export/starexec/sandbox/benchmark/Axioms/SWC001+0.ax',ax81) ).
fof(ax20,axiom,
! [X1] :
( ssList(X1)
=> ( ? [X2] :
( ? [X3] :
( cons(X3,X2) = X1
& ssItem(X3) )
& ssList(X2) )
| nil = X1 ) ),
file('/export/starexec/sandbox/benchmark/Axioms/SWC001+0.ax',ax20) ).
fof(ax15,axiom,
! [X1] :
( ssList(X1)
=> ! [X2] :
( ssList(X2)
=> ( neq(X1,X2)
<=> X1 != X2 ) ) ),
file('/export/starexec/sandbox/benchmark/Axioms/SWC001+0.ax',ax15) ).
fof(ax17,axiom,
ssList(nil),
file('/export/starexec/sandbox/benchmark/Axioms/SWC001+0.ax',ax17) ).
fof(c_0_5,negated_conjecture,
~ ! [X1] :
( ssList(X1)
=> ! [X2] :
( ssList(X2)
=> ! [X3] :
( ssList(X3)
=> ! [X4] :
( ssList(X4)
=> ( ( nil = X4
& nil != X3 )
| ? [X7] :
( ? [X8] :
( app(cons(X7,nil),X8) = X4
& app(X8,cons(X7,nil)) != X3
& ssList(X8) )
& ssItem(X7) )
| ? [X5] :
( ? [X6] :
( app(X6,cons(X5,nil)) = X1
& app(cons(X5,nil),X6) = X2
& ssList(X6) )
& ssItem(X5) )
| ~ neq(X2,nil)
| X1 != X3
| X2 != X4 ) ) ) ) ),
inference(assume_negation,[status(cth)],[co1]) ).
fof(c_0_6,negated_conjecture,
~ ! [X1] :
( ssList(X1)
=> ! [X2] :
( ssList(X2)
=> ! [X3] :
( ssList(X3)
=> ! [X4] :
( ssList(X4)
=> ( ( nil = X4
& nil != X3 )
| ? [X7] :
( ? [X8] :
( app(cons(X7,nil),X8) = X4
& app(X8,cons(X7,nil)) != X3
& ssList(X8) )
& ssItem(X7) )
| ? [X5] :
( ? [X6] :
( app(X6,cons(X5,nil)) = X1
& app(cons(X5,nil),X6) = X2
& ssList(X6) )
& ssItem(X5) )
| ~ neq(X2,nil)
| X1 != X3
| X2 != X4 ) ) ) ) ),
inference(fof_simplification,[status(thm)],[c_0_5]) ).
fof(c_0_7,negated_conjecture,
! [X13,X14,X15,X16] :
( ( nil != esk4_0
| nil = esk3_0 )
& ( app(cons(X15,nil),X16) != esk4_0
| app(X16,cons(X15,nil)) = esk3_0
| ~ ssList(X16)
| ~ ssItem(X15) )
& ( app(X14,cons(X13,nil)) != esk1_0
| app(cons(X13,nil),X14) != esk2_0
| ~ ssList(X14)
| ~ ssItem(X13) )
& 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(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_6])])])])]) ).
cnf(c_0_8,negated_conjecture,
( app(X2,cons(X1,nil)) != esk1_0
| app(cons(X1,nil),X2) != esk2_0
| ~ ssList(X2)
| ~ ssItem(X1) ),
inference(split_conjunct,[status(thm)],[c_0_7]) ).
cnf(c_0_9,negated_conjecture,
esk1_0 = esk3_0,
inference(split_conjunct,[status(thm)],[c_0_7]) ).
cnf(c_0_10,negated_conjecture,
esk2_0 = esk4_0,
inference(split_conjunct,[status(thm)],[c_0_7]) ).
cnf(c_0_11,negated_conjecture,
( app(cons(X1,nil),X2) != esk4_0
| ~ ssList(X2)
| ~ ssItem(X1)
| app(X2,cons(X1,nil)) = esk3_0 ),
inference(split_conjunct,[status(thm)],[c_0_7]) ).
fof(c_0_12,plain,
! [X34,X35] :
( cons(X35,X34) = app(cons(X35,nil),X34)
| ~ ssItem(X35)
| ~ ssList(X34) ),
inference(fof_nnf,[status(thm)],[inference(shift_quantors,[status(thm)],[inference(variable_rename,[status(thm)],[inference(fof_nnf,[status(thm)],[ax81])])])]) ).
cnf(c_0_13,negated_conjecture,
( ~ ssItem(X1)
| ~ ssList(X2)
| app(cons(X1,nil),X2) != esk4_0 ),
inference(csr,[status(thm)],[inference(rw,[status(thm)],[inference(rw,[status(thm)],[c_0_8,c_0_9]),c_0_10]),c_0_11]) ).
cnf(c_0_14,plain,
( ~ ssItem(X2)
| ~ ssList(X1)
| cons(X2,X1) = app(cons(X2,nil),X1) ),
inference(split_conjunct,[status(thm)],[c_0_12]) ).
fof(c_0_15,plain,
! [X17] :
( ( ~ ssList(X17)
| nil = X17
| cons(esk6_1(X17),esk5_1(X17)) = X17 )
& ( ~ ssList(X17)
| nil = X17
| ssItem(esk6_1(X17)) )
& ( ~ ssList(X17)
| nil = X17
| ssList(esk5_1(X17)) ) ),
inference(distribute,[status(thm)],[inference(fof_nnf,[status(thm)],[inference(skolemize,[status(esa)],[inference(variable_rename,[status(thm)],[inference(fof_nnf,[status(thm)],[ax20])])])])]) ).
cnf(c_0_16,negated_conjecture,
( ~ ssItem(X1)
| ~ ssList(X2)
| cons(X1,X2) != esk4_0 ),
inference(spm,[status(thm)],[c_0_13,c_0_14]) ).
cnf(c_0_17,plain,
( ~ ssList(X1)
| nil = X1
| cons(esk6_1(X1),esk5_1(X1)) = X1 ),
inference(split_conjunct,[status(thm)],[c_0_15]) ).
cnf(c_0_18,negated_conjecture,
ssList(esk4_0),
inference(split_conjunct,[status(thm)],[c_0_7]) ).
fof(c_0_19,plain,
! [X1] :
( ssList(X1)
=> ! [X2] :
( ssList(X2)
=> ( neq(X1,X2)
<=> X1 != X2 ) ) ),
inference(fof_simplification,[status(thm)],[ax15]) ).
cnf(c_0_20,negated_conjecture,
( ~ ssItem(esk6_1(esk4_0))
| ~ ssList(esk5_1(esk4_0))
| esk4_0 = nil ),
inference(cn,[status(thm)],[inference(rw,[status(thm)],[inference(er,[status(thm)],[inference(spm,[status(thm)],[c_0_16,c_0_17])]),c_0_18])]) ).
cnf(c_0_21,plain,
( ~ ssList(X1)
| nil = X1
| ssItem(esk6_1(X1)) ),
inference(split_conjunct,[status(thm)],[c_0_15]) ).
fof(c_0_22,plain,
! [X54,X55] :
( ( ~ ssList(X54)
| ~ ssList(X55)
| neq(X54,X55)
| X54 = X55 )
& ( ~ ssList(X54)
| ~ ssList(X55)
| X54 != X55
| ~ neq(X54,X55) ) ),
inference(distribute,[status(thm)],[inference(fof_nnf,[status(thm)],[inference(shift_quantors,[status(thm)],[inference(variable_rename,[status(thm)],[inference(fof_nnf,[status(thm)],[c_0_19])])])])]) ).
cnf(c_0_23,negated_conjecture,
neq(esk2_0,nil),
inference(split_conjunct,[status(thm)],[c_0_7]) ).
cnf(c_0_24,negated_conjecture,
( ~ ssList(esk5_1(esk4_0))
| esk4_0 = nil ),
inference(cn,[status(thm)],[inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_20,c_0_21]),c_0_18])]) ).
cnf(c_0_25,plain,
( ~ ssList(X1)
| nil = X1
| ssList(esk5_1(X1)) ),
inference(split_conjunct,[status(thm)],[c_0_15]) ).
cnf(c_0_26,plain,
( ~ ssList(X1)
| ~ ssList(X2)
| X1 != X2
| ~ neq(X1,X2) ),
inference(split_conjunct,[status(thm)],[c_0_22]) ).
cnf(c_0_27,negated_conjecture,
neq(esk4_0,nil),
inference(rw,[status(thm)],[c_0_23,c_0_10]) ).
cnf(c_0_28,negated_conjecture,
esk4_0 = nil,
inference(cn,[status(thm)],[inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_24,c_0_25]),c_0_18])]) ).
cnf(c_0_29,plain,
( ~ neq(X1,X1)
| ~ ssList(X1) ),
inference(er,[status(thm)],[c_0_26]) ).
cnf(c_0_30,negated_conjecture,
neq(nil,nil),
inference(rw,[status(thm)],[c_0_27,c_0_28]) ).
cnf(c_0_31,plain,
ssList(nil),
inference(split_conjunct,[status(thm)],[ax17]) ).
cnf(c_0_32,negated_conjecture,
$false,
inference(cn,[status(thm)],[inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_29,c_0_30]),c_0_31])]),
[proof] ).
%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.00/0.05 % Problem : SWC309+1 : TPTP v9.3.1. Released v2.4.0.
% 0.00/0.08 % Command : run_E /export/starexec/sandbox/benchmark/theBenchmark.p 300 THM
% 0.19/0.50 % Computer : n026.cluster.edu
% 0.19/0.50 % Model : x86_64 x86_64
% 0.19/0.50 % CPU : Intel(R) Xeon(R) CPU E5-2620 v4 @ 2.10GHz
% 0.19/0.50 % Memory : 8046.5625MB
% 0.19/0.50 % OS : Linux 6.8.0-71-generic
% 0.19/0.50 % CPULimit : 300
% 0.19/0.50 % WCLimit : 300
% 0.19/0.50 % DateTime : Mon Sep 21 08:16:51 UTC 2026
% 0.19/0.51 % CPUTime :
% 0.19/0.51 Running run_E /export/starexec/sandbox/benchmark/theBenchmark.p 300 THM
% 0.24/0.59 Running first-order theorem proving
% 0.24/0.59 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.39/0.63 % Version: 3.5.1
% 0.39/0.63 % Preprocessing class: FSLSSMSSSSSNFFN.
% 0.39/0.63 % Scheduled 4 strats onto 8 cores with 300 seconds (2400 total)
% 0.39/0.63 % Starting G-E--_207_C18_F1_SE_CS_SP_PI_PS_S5PRR_S2S with 1500s (5) cores
% 0.39/0.63 % Starting new_bool_3 with 300s (1) cores
% 0.39/0.63 % Starting new_bool_1 with 300s (1) cores
% 0.39/0.63 % Starting sh5l with 300s (1) cores
% 0.39/0.63 % new_bool_1 with pid 1813669 completed with status 0
% 0.39/0.63 % Result found by new_bool_1
% 0.39/0.63 % Preprocessing class: FSLSSMSSSSSNFFN.
% 0.39/0.63 % Scheduled 4 strats onto 8 cores with 300 seconds (2400 total)
% 0.39/0.63 % Starting G-E--_207_C18_F1_SE_CS_SP_PI_PS_S5PRR_S2S with 1500s (5) cores
% 0.39/0.63 % Starting new_bool_3 with 300s (1) cores
% 0.39/0.63 % Starting new_bool_1 with 300s (1) cores
% 0.39/0.63 % (lift_lambdas = 0, lambda_to_forall = 0,unroll_only_formulas = 0, sine = GSinE(CountFormulas,hypos,1.5,,3,20000,1.0))
% 0.39/0.63 % SinE strategy is GSinE(CountFormulas,hypos,1.5,,3,20000,1.0)
% 0.39/0.63 % Search class: FGHSF-FFMM21-SFFFFFNN
% 0.39/0.63 % Scheduled 7 strats onto 1 cores with 300 seconds (300 total)
% 0.39/0.63 % Starting SubtermCWHack with 28s (1) cores
% 0.39/0.63 % SubtermCWHack with pid 1813672 completed with status 0
% 0.39/0.63 % Result found by SubtermCWHack
% 0.39/0.63 % Preprocessing class: FSLSSMSSSSSNFFN.
% 0.39/0.63 % Scheduled 4 strats onto 8 cores with 300 seconds (2400 total)
% 0.39/0.63 % Starting G-E--_207_C18_F1_SE_CS_SP_PI_PS_S5PRR_S2S with 1500s (5) cores
% 0.39/0.63 % Starting new_bool_3 with 300s (1) cores
% 0.39/0.63 % Starting new_bool_1 with 300s (1) cores
% 0.39/0.63 % (lift_lambdas = 0, lambda_to_forall = 0,unroll_only_formulas = 0, sine = GSinE(CountFormulas,hypos,1.5,,3,20000,1.0))
% 0.39/0.63 % SinE strategy is GSinE(CountFormulas,hypos,1.5,,3,20000,1.0)
% 0.39/0.63 % Search class: FGHSF-FFMM21-SFFFFFNN
% 0.39/0.63 % Scheduled 7 strats onto 1 cores with 300 seconds (300 total)
% 0.39/0.63 % Starting SubtermCWHack with 28s (1) cores
% 0.39/0.63 % Preprocessing time : 0.001 s
% 0.39/0.63
% 0.39/0.63 % Proof found!
% 0.39/0.63 % SZS status Theorem
% 0.39/0.63 % SZS output start CNFRefutation
% See solution above
% 0.39/0.63 % Parsed axioms : 96
% 0.39/0.63 % Removed by relevancy pruning/SinE : 77
% 0.39/0.63 % Initial clauses : 37
% 0.39/0.63 % Removed in clause preprocessing : 0
% 0.39/0.63 % Initial clauses in saturation : 37
% 0.39/0.63 % Processed clauses : 91
% 0.39/0.63 % ...of these trivial : 0
% 0.39/0.63 % ...subsumed : 29
% 0.39/0.63 % ...remaining for further processing : 62
% 0.39/0.63 % Other redundant clauses eliminated : 13
% 0.39/0.63 % Clauses deleted for lack of memory : 0
% 0.39/0.63 % Backward-subsumed : 3
% 0.39/0.63 % Backward-rewritten : 10
% 0.39/0.63 % Generated clauses : 223
% 0.39/0.63 % ...of the previous two non-redundant : 166
% 0.39/0.63 % ...aggressively subsumed : 0
% 0.39/0.63 % Contextual simplify-reflections : 5
% 0.39/0.63 % Paramodulations : 207
% 0.39/0.63 % Factorizations : 0
% 0.39/0.63 % NegExts : 0
% 0.39/0.63 % Equation resolutions : 17
% 0.39/0.63 % Disequality decompositions : 0
% 0.39/0.63 % Total rewrite steps : 147
% 0.39/0.63 % ...of those cached : 140
% 0.39/0.63 % Propositional unsat checks : 0
% 0.39/0.63 % Propositional check models : 0
% 0.39/0.63 % Propositional check unsatisfiable : 0
% 0.39/0.63 % Propositional clauses : 0
% 0.39/0.63 % Propositional clauses after purity: 0
% 0.39/0.63 % Propositional unsat core size : 0
% 0.39/0.63 % Propositional preprocessing time : 0.000
% 0.39/0.63 % Propositional encoding time : 0.000
% 0.39/0.63 % Propositional solver time : 0.000
% 0.39/0.63 % Success case prop preproc time : 0.000
% 0.39/0.63 % Success case prop encoding time : 0.000
% 0.39/0.63 % Success case prop solver time : 0.000
% 0.39/0.63 % Current number of processed clauses : 46
% 0.39/0.63 % Positive orientable unit clauses : 8
% 0.39/0.63 % Positive unorientable unit clauses: 0
% 0.39/0.63 % Negative unit clauses : 1
% 0.39/0.63 % Non-unit-clauses : 37
% 0.39/0.63 % Current number of unprocessed clauses: 111
% 0.39/0.63 % ...number of literals in the above : 583
% 0.39/0.63 % Current number of archived formulas : 0
% 0.39/0.63 % Current number of archived clauses : 13
% 0.39/0.63 % Clause-clause subsumption calls (NU) : 425
% 0.39/0.63 % Rec. Clause-clause subsumption calls : 222
% 0.39/0.63 % Non-unit clause-clause subsumptions : 37
% 0.39/0.63 % Unit Clause-clause subsumption calls : 21
% 0.39/0.63 % Rewrite failures with RHS unbound : 0
% 0.39/0.63 % BW rewrite match attempts : 3
% 0.39/0.63 % BW rewrite match successes : 3
% 0.39/0.63 % Condensation attempts : 0
% 0.39/0.63 % Condensation successes : 0
% 0.39/0.63 % Termbank termtop insertions : 7418
% 0.39/0.63 % Search garbage collected termcells : 1362
% 0.39/0.63
% 0.39/0.63 % -------------------------------------------------
% 0.39/0.63 % User time : 0.011 s
% 0.39/0.63 % System time : 0.003 s
% 0.39/0.63 % Total time : 0.014 s
% 0.39/0.63 % Maximum resident set size: 3760 pages
% 0.39/0.63
% 0.39/0.63 % -------------------------------------------------
% 0.39/0.63 % User time : 0.019 s
% 0.39/0.63 % System time : 0.008 s
% 0.39/0.63 % Total time : 0.027 s
% 0.39/0.63 % Maximum resident set size: 4864 pages
% 0.39/0.63 % E exiting
%------------------------------------------------------------------------------