%------------------------------------------------------------------------------
% File : E---3.5.1
% Problem : SWC355+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 : n019.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:03 PM UTC 2026
% Result : Theorem 0.14s 0.51s
% Output : CNFRefutation 0.14s
% Verified :
% SZS Type : Refutation
% Derivation depth : 9
% Number of leaves : 6
% Syntax : Number of formulae : 33 ( 10 unt; 0 def)
% Number of atoms : 127 ( 20 equ)
% Maximal formula atoms : 22 ( 3 avg)
% Number of connectives : 149 ( 55 ~; 54 |; 16 &)
% ( 0 <=>; 24 =>; 0 <=; 0 <~>)
% Maximal formula depth : 18 ( 5 avg)
% Maximal term depth : 3 ( 1 avg)
% Number of predicates : 6 ( 4 usr; 1 prp; 0-2 aty)
% Number of functors : 8 ( 8 usr; 6 con; 0-2 aty)
% Number of variables : 44 ( 0 sgn 31 !; 0 ?)
% Comments :
%------------------------------------------------------------------------------
fof(co1,conjecture,
! [X1] :
( ssList(X1)
=> ! [X2] :
( ssList(X2)
=> ! [X3] :
( ssList(X3)
=> ! [X4] :
( ssList(X4)
=> ( ( ( neq(X4,nil)
| ~ neq(X2,nil) )
& ( segmentP(X2,X1)
| ! [X5] :
( ssItem(X5)
=> app(X3,cons(X5,nil)) != X4 )
| ~ neq(X2,nil) ) )
| X1 != X3
| X2 != X4 ) ) ) ) ),
file('/export/starexec/sandbox2/benchmark/theBenchmark.p',co1) ).
fof(ax56,axiom,
! [X1] :
( ssList(X1)
=> ! [X2] :
( ssList(X2)
=> ! [X3] :
( ssList(X3)
=> ! [X4] :
( ssList(X4)
=> ( segmentP(X1,X2)
=> segmentP(app(app(X3,X1),X4),X2) ) ) ) ) ),
file('/export/starexec/sandbox2/benchmark/Axioms/SWC001+0.ax',ax56) ).
fof(ax28,axiom,
! [X1] :
( ssList(X1)
=> app(nil,X1) = X1 ),
file('/export/starexec/sandbox2/benchmark/Axioms/SWC001+0.ax',ax28) ).
fof(ax17,axiom,
ssList(nil),
file('/export/starexec/sandbox2/benchmark/Axioms/SWC001+0.ax',ax17) ).
fof(ax16,axiom,
! [X1] :
( ssList(X1)
=> ! [X2] :
( ssItem(X2)
=> ssList(cons(X2,X1)) ) ),
file('/export/starexec/sandbox2/benchmark/Axioms/SWC001+0.ax',ax16) ).
fof(ax55,axiom,
! [X1] :
( ssList(X1)
=> segmentP(X1,X1) ),
file('/export/starexec/sandbox2/benchmark/Axioms/SWC001+0.ax',ax55) ).
fof(c_0_6,negated_conjecture,
~ ! [X1] :
( ssList(X1)
=> ! [X2] :
( ssList(X2)
=> ! [X3] :
( ssList(X3)
=> ! [X4] :
( ssList(X4)
=> ( ( ( neq(X4,nil)
| ~ neq(X2,nil) )
& ( segmentP(X2,X1)
| ! [X5] :
( ssItem(X5)
=> app(X3,cons(X5,nil)) != X4 )
| ~ neq(X2,nil) ) )
| X1 != X3
| X2 != X4 ) ) ) ) ),
inference(assume_negation,[status(cth)],[co1]) ).
fof(c_0_7,negated_conjecture,
~ ! [X1] :
( ssList(X1)
=> ! [X2] :
( ssList(X2)
=> ! [X3] :
( ssList(X3)
=> ! [X4] :
( ssList(X4)
=> ( ( ( neq(X4,nil)
| ~ neq(X2,nil) )
& ( segmentP(X2,X1)
| ! [X5] :
( ssItem(X5)
=> app(X3,cons(X5,nil)) != X4 )
| ~ neq(X2,nil) ) )
| X1 != X3
| X2 != X4 ) ) ) ) ),
inference(fof_simplification,[status(thm)],[c_0_6]) ).
fof(c_0_8,negated_conjecture,
( ( ~ segmentP(esk2_0,esk1_0)
| ~ neq(esk4_0,nil) )
& ( ~ segmentP(esk2_0,esk1_0)
| neq(esk2_0,nil) )
& ( app(esk3_0,cons(esk5_0,nil)) = esk4_0
| ~ neq(esk4_0,nil) )
& ( app(esk3_0,cons(esk5_0,nil)) = esk4_0
| neq(esk2_0,nil) )
& ( ssItem(esk5_0)
| ~ neq(esk4_0,nil) )
& ( ssItem(esk5_0)
| 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(skolemize,[status(esa)],[inference(variable_rename,[status(thm)],[inference(fof_nnf,[status(thm)],[c_0_7])])])])]) ).
fof(c_0_9,plain,
! [X33,X34,X35,X36] :
( segmentP(app(app(X35,X33),X36),X34)
| ~ segmentP(X33,X34)
| ~ ssList(X36)
| ~ ssList(X35)
| ~ ssList(X34)
| ~ ssList(X33) ),
inference(fof_nnf,[status(thm)],[inference(shift_quantors,[status(thm)],[inference(variable_rename,[status(thm)],[inference(fof_nnf,[status(thm)],[ax56])])])]) ).
fof(c_0_10,plain,
! [X44] :
( app(nil,X44) = X44
| ~ ssList(X44) ),
inference(fof_nnf,[status(thm)],[inference(variable_rename,[status(thm)],[inference(fof_nnf,[status(thm)],[ax28])])]) ).
cnf(c_0_11,negated_conjecture,
( neq(esk2_0,nil)
| neq(esk2_0,nil) ),
inference(split_conjunct,[status(thm)],[c_0_8]) ).
cnf(c_0_12,plain,
( ~ segmentP(X1,X2)
| ~ ssList(X4)
| ~ ssList(X3)
| ~ ssList(X2)
| ~ ssList(X1)
| segmentP(app(app(X3,X1),X4),X2) ),
inference(split_conjunct,[status(thm)],[c_0_9]) ).
cnf(c_0_13,plain,
( ~ ssList(X1)
| app(nil,X1) = X1 ),
inference(split_conjunct,[status(thm)],[c_0_10]) ).
cnf(c_0_14,plain,
ssList(nil),
inference(split_conjunct,[status(thm)],[ax17]) ).
cnf(c_0_15,negated_conjecture,
( ~ neq(esk4_0,nil)
| app(esk3_0,cons(esk5_0,nil)) = esk4_0 ),
inference(split_conjunct,[status(thm)],[c_0_8]) ).
cnf(c_0_16,negated_conjecture,
esk1_0 = esk3_0,
inference(split_conjunct,[status(thm)],[c_0_8]) ).
cnf(c_0_17,negated_conjecture,
esk2_0 = esk4_0,
inference(split_conjunct,[status(thm)],[c_0_8]) ).
cnf(c_0_18,negated_conjecture,
neq(esk2_0,nil),
inference(cn,[status(thm)],[c_0_11]) ).
cnf(c_0_19,plain,
( ~ ssList(X1)
| ~ ssList(X3)
| ~ ssList(X2)
| ~ segmentP(X1,X3)
| segmentP(app(X1,X2),X3) ),
inference(cn,[status(thm)],[inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_12,c_0_13]),c_0_14])]) ).
cnf(c_0_20,negated_conjecture,
app(esk1_0,cons(esk5_0,nil)) = esk2_0,
inference(cn,[status(thm)],[inference(rw,[status(thm)],[inference(rw,[status(thm)],[inference(rw,[status(thm)],[inference(rw,[status(thm)],[c_0_15,c_0_16]),c_0_17]),c_0_17]),c_0_18])]) ).
cnf(c_0_21,negated_conjecture,
ssList(esk1_0),
inference(split_conjunct,[status(thm)],[c_0_8]) ).
fof(c_0_22,plain,
! [X59,X60] :
( ssList(cons(X60,X59))
| ~ ssItem(X60)
| ~ ssList(X59) ),
inference(fof_nnf,[status(thm)],[inference(shift_quantors,[status(thm)],[inference(variable_rename,[status(thm)],[inference(fof_nnf,[status(thm)],[ax16])])])]) ).
cnf(c_0_23,negated_conjecture,
( ~ neq(esk4_0,nil)
| ssItem(esk5_0) ),
inference(split_conjunct,[status(thm)],[c_0_8]) ).
cnf(c_0_24,negated_conjecture,
( ~ ssList(X1)
| ~ ssList(cons(esk5_0,nil))
| ~ segmentP(esk1_0,X1)
| segmentP(esk2_0,X1) ),
inference(cn,[status(thm)],[inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_19,c_0_20]),c_0_21])]) ).
cnf(c_0_25,plain,
( ~ ssItem(X2)
| ~ ssList(X1)
| ssList(cons(X2,X1)) ),
inference(split_conjunct,[status(thm)],[c_0_22]) ).
cnf(c_0_26,negated_conjecture,
ssItem(esk5_0),
inference(cn,[status(thm)],[inference(rw,[status(thm)],[inference(rw,[status(thm)],[c_0_23,c_0_17]),c_0_18])]) ).
fof(c_0_27,plain,
! [X32] :
( segmentP(X32,X32)
| ~ ssList(X32) ),
inference(fof_nnf,[status(thm)],[inference(variable_rename,[status(thm)],[inference(fof_nnf,[status(thm)],[ax55])])]) ).
cnf(c_0_28,negated_conjecture,
( ~ segmentP(esk2_0,esk1_0)
| ~ neq(esk4_0,nil) ),
inference(split_conjunct,[status(thm)],[c_0_8]) ).
cnf(c_0_29,negated_conjecture,
( ~ ssList(X1)
| ~ segmentP(esk1_0,X1)
| segmentP(esk2_0,X1) ),
inference(cn,[status(thm)],[inference(rw,[status(thm)],[inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_24,c_0_25]),c_0_14]),c_0_26])]) ).
cnf(c_0_30,plain,
( ~ ssList(X1)
| segmentP(X1,X1) ),
inference(split_conjunct,[status(thm)],[c_0_27]) ).
cnf(c_0_31,negated_conjecture,
~ segmentP(esk2_0,esk1_0),
inference(cn,[status(thm)],[inference(rw,[status(thm)],[inference(rw,[status(thm)],[c_0_28,c_0_17]),c_0_18])]) ).
cnf(c_0_32,negated_conjecture,
$false,
inference(sr,[status(thm)],[inference(cn,[status(thm)],[inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_29,c_0_30]),c_0_21])]),c_0_31]),
[proof] ).
%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.00/0.03 % Problem : SWC355+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.10/0.35 % Computer : n019.cluster.edu
% 0.10/0.35 % Model : x86_64 x86_64
% 0.10/0.35 % CPU : Intel(R) Xeon(R) CPU E5-2620 v4 @ 2.10GHz
% 0.10/0.35 % Memory : 8046.5625MB
% 0.10/0.35 % 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 08:18:34 UTC 2026
% 0.10/0.36 % CPUTime :
% 0.10/0.36 Running run_E /export/starexec/sandbox2/benchmark/theBenchmark.p 300 THM
% 0.14/0.43 Running first-order theorem proving
% 0.14/0.43 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.14/0.51 % Version: 3.5.1
% 0.14/0.51 % Preprocessing class: FSLSSMSSSSSNFFN.
% 0.14/0.51 % Scheduled 4 strats onto 8 cores with 300 seconds (2400 total)
% 0.14/0.51 % Starting G-E--_207_C18_F1_SE_CS_SP_PI_PS_S5PRR_S2S with 1500s (5) cores
% 0.14/0.51 % Starting new_bool_3 with 300s (1) cores
% 0.14/0.51 % Starting new_bool_1 with 300s (1) cores
% 0.14/0.51 % Starting sh5l with 300s (1) cores
% 0.14/0.51 % new_bool_3 with pid 2119294 completed with status 0
% 0.14/0.51 % Result found by new_bool_3
% 0.14/0.51 % Preprocessing class: FSLSSMSSSSSNFFN.
% 0.14/0.51 % Scheduled 4 strats onto 8 cores with 300 seconds (2400 total)
% 0.14/0.51 % Starting G-E--_207_C18_F1_SE_CS_SP_PI_PS_S5PRR_S2S with 1500s (5) cores
% 0.14/0.51 % Starting new_bool_3 with 300s (1) cores
% 0.14/0.51 % (lift_lambdas = 0, lambda_to_forall = 0,unroll_only_formulas = 0, sine = GSinE(CountFormulas,hypos,1.5,,3,20000,1.0))
% 0.14/0.51 % SinE strategy is GSinE(CountFormulas,hypos,1.5,,3,20000,1.0)
% 0.14/0.51 % Search class: FGHSF-FFMM21-MFFFFFNN
% 0.14/0.51 % Scheduled 5 strats onto 1 cores with 300 seconds (300 total)
% 0.14/0.51 % Starting SubtermCWHack with 31s (1) cores
% 0.14/0.51 % SubtermCWHack with pid 2119297 completed with status 0
% 0.14/0.51 % Result found by SubtermCWHack
% 0.14/0.51 % Preprocessing class: FSLSSMSSSSSNFFN.
% 0.14/0.51 % Scheduled 4 strats onto 8 cores with 300 seconds (2400 total)
% 0.14/0.51 % Starting G-E--_207_C18_F1_SE_CS_SP_PI_PS_S5PRR_S2S with 1500s (5) cores
% 0.14/0.51 % Starting new_bool_3 with 300s (1) cores
% 0.14/0.51 % (lift_lambdas = 0, lambda_to_forall = 0,unroll_only_formulas = 0, sine = GSinE(CountFormulas,hypos,1.5,,3,20000,1.0))
% 0.14/0.51 % SinE strategy is GSinE(CountFormulas,hypos,1.5,,3,20000,1.0)
% 0.14/0.51 % Search class: FGHSF-FFMM21-MFFFFFNN
% 0.14/0.51 % Scheduled 5 strats onto 1 cores with 300 seconds (300 total)
% 0.14/0.51 % Starting SubtermCWHack with 31s (1) cores
% 0.14/0.51 % Preprocessing time : 0.003 s
% 0.14/0.51
% 0.14/0.51 % Proof found!
% 0.14/0.51 % SZS status Theorem
% 0.14/0.51 % SZS output start CNFRefutation
% See solution above
% 0.14/0.51 % Parsed axioms : 96
% 0.14/0.51 % Removed by relevancy pruning/SinE : 70
% 0.14/0.51 % Initial clauses : 52
% 0.14/0.51 % Removed in clause preprocessing : 0
% 0.14/0.51 % Initial clauses in saturation : 52
% 0.14/0.51 % Processed clauses : 133
% 0.14/0.51 % ...of these trivial : 4
% 0.14/0.51 % ...subsumed : 35
% 0.14/0.51 % ...remaining for further processing : 94
% 0.14/0.51 % Other redundant clauses eliminated : 16
% 0.14/0.51 % Clauses deleted for lack of memory : 0
% 0.14/0.51 % Backward-subsumed : 8
% 0.14/0.51 % Backward-rewritten : 3
% 0.14/0.51 % Generated clauses : 330
% 0.14/0.51 % ...of the previous two non-redundant : 251
% 0.14/0.51 % ...aggressively subsumed : 0
% 0.14/0.51 % Contextual simplify-reflections : 5
% 0.14/0.51 % Paramodulations : 311
% 0.14/0.51 % Factorizations : 0
% 0.14/0.51 % NegExts : 0
% 0.14/0.51 % Equation resolutions : 20
% 0.14/0.51 % Disequality decompositions : 0
% 0.14/0.51 % Total rewrite steps : 256
% 0.14/0.51 % ...of those cached : 247
% 0.14/0.51 % Propositional unsat checks : 0
% 0.14/0.51 % Propositional check models : 0
% 0.14/0.51 % Propositional check unsatisfiable : 0
% 0.14/0.51 % Propositional clauses : 0
% 0.14/0.51 % Propositional clauses after purity: 0
% 0.14/0.51 % Propositional unsat core size : 0
% 0.14/0.51 % Propositional preprocessing time : 0.000
% 0.14/0.51 % Propositional encoding time : 0.000
% 0.14/0.51 % Propositional solver time : 0.000
% 0.14/0.51 % Success case prop preproc time : 0.000
% 0.14/0.51 % Success case prop encoding time : 0.000
% 0.14/0.51 % Success case prop solver time : 0.000
% 0.14/0.51 % Current number of processed clauses : 78
% 0.14/0.51 % Positive orientable unit clauses : 13
% 0.14/0.51 % Positive unorientable unit clauses: 0
% 0.14/0.51 % Negative unit clauses : 5
% 0.14/0.51 % Non-unit-clauses : 60
% 0.14/0.51 % Current number of unprocessed clauses: 164
% 0.14/0.51 % ...number of literals in the above : 913
% 0.14/0.51 % Current number of archived formulas : 0
% 0.14/0.51 % Current number of archived clauses : 11
% 0.14/0.51 % Clause-clause subsumption calls (NU) : 648
% 0.14/0.51 % Rec. Clause-clause subsumption calls : 301
% 0.14/0.51 % Non-unit clause-clause subsumptions : 43
% 0.14/0.51 % Unit Clause-clause subsumption calls : 22
% 0.14/0.51 % Rewrite failures with RHS unbound : 0
% 0.14/0.51 % BW rewrite match attempts : 3
% 0.14/0.51 % BW rewrite match successes : 3
% 0.14/0.51 % Condensation attempts : 0
% 0.14/0.51 % Condensation successes : 0
% 0.14/0.51 % Termbank termtop insertions : 10353
% 0.14/0.51 % Search garbage collected termcells : 1512
% 0.14/0.51
% 0.14/0.51 % -------------------------------------------------
% 0.14/0.51 % User time : 0.020 s
% 0.14/0.51 % System time : 0.009 s
% 0.14/0.51 % Total time : 0.029 s
% 0.14/0.51 % Maximum resident set size: 3756 pages
% 0.14/0.51
% 0.14/0.51 % -------------------------------------------------
% 0.14/0.51 % User time : 0.029 s
% 0.14/0.51 % System time : 0.014 s
% 0.14/0.51 % Total time : 0.042 s
% 0.14/0.51 % Maximum resident set size: 4864 pages
% 0.14/0.51 % E exiting
%------------------------------------------------------------------------------