%------------------------------------------------------------------------------
% File : E---3.5.1
% Problem : SWC364+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 : n002.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:06 PM UTC 2026
% Result : Theorem 0.18s 1.07s
% Output : CNFRefutation 0.18s
% Verified :
% SZS Type : Refutation
% Derivation depth : 10
% Number of leaves : 6
% Syntax : Number of formulae : 34 ( 11 unt; 0 def)
% Number of atoms : 128 ( 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 : 43 ( 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(cons(X5,nil),X3) != X4 )
| ~ neq(X2,nil) ) )
| X1 != X3
| X2 != X4 ) ) ) ) ),
file('/export/starexec/sandbox/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/sandbox/benchmark/Axioms/SWC001+0.ax',ax56) ).
fof(ax84,axiom,
! [X1] :
( ssList(X1)
=> app(X1,nil) = X1 ),
file('/export/starexec/sandbox/benchmark/Axioms/SWC001+0.ax',ax84) ).
fof(ax17,axiom,
ssList(nil),
file('/export/starexec/sandbox/benchmark/Axioms/SWC001+0.ax',ax17) ).
fof(ax16,axiom,
! [X1] :
( ssList(X1)
=> ! [X2] :
( ssItem(X2)
=> ssList(cons(X2,X1)) ) ),
file('/export/starexec/sandbox/benchmark/Axioms/SWC001+0.ax',ax16) ).
fof(ax55,axiom,
! [X1] :
( ssList(X1)
=> segmentP(X1,X1) ),
file('/export/starexec/sandbox/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(cons(X5,nil),X3) != 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(cons(X5,nil),X3) != 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(cons(esk5_0,nil),esk3_0) = esk4_0
| ~ neq(esk4_0,nil) )
& ( app(cons(esk5_0,nil),esk3_0) = 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])])])])]) ).
cnf(c_0_9,negated_conjecture,
( neq(esk2_0,nil)
| neq(esk2_0,nil) ),
inference(split_conjunct,[status(thm)],[c_0_8]) ).
fof(c_0_10,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])])])]) ).
cnf(c_0_11,negated_conjecture,
( ~ neq(esk4_0,nil)
| app(cons(esk5_0,nil),esk3_0) = esk4_0 ),
inference(split_conjunct,[status(thm)],[c_0_8]) ).
cnf(c_0_12,negated_conjecture,
esk1_0 = esk3_0,
inference(split_conjunct,[status(thm)],[c_0_8]) ).
cnf(c_0_13,negated_conjecture,
esk2_0 = esk4_0,
inference(split_conjunct,[status(thm)],[c_0_8]) ).
cnf(c_0_14,negated_conjecture,
neq(esk2_0,nil),
inference(cn,[status(thm)],[c_0_9]) ).
cnf(c_0_15,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_10]) ).
cnf(c_0_16,negated_conjecture,
app(cons(esk5_0,nil),esk1_0) = esk2_0,
inference(cn,[status(thm)],[inference(rw,[status(thm)],[inference(rw,[status(thm)],[inference(rw,[status(thm)],[inference(rw,[status(thm)],[c_0_11,c_0_12]),c_0_13]),c_0_13]),c_0_14])]) ).
cnf(c_0_17,negated_conjecture,
ssList(esk1_0),
inference(split_conjunct,[status(thm)],[c_0_8]) ).
fof(c_0_18,plain,
! [X58] :
( app(X58,nil) = X58
| ~ ssList(X58) ),
inference(fof_nnf,[status(thm)],[inference(variable_rename,[status(thm)],[inference(fof_nnf,[status(thm)],[ax84])])]) ).
cnf(c_0_19,negated_conjecture,
( ~ ssList(X2)
| ~ ssList(X1)
| ~ ssList(cons(esk5_0,nil))
| ~ segmentP(esk1_0,X2)
| segmentP(app(esk2_0,X1),X2) ),
inference(cn,[status(thm)],[inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_15,c_0_16]),c_0_17])]) ).
cnf(c_0_20,plain,
( ~ ssList(X1)
| app(X1,nil) = X1 ),
inference(split_conjunct,[status(thm)],[c_0_18]) ).
cnf(c_0_21,plain,
ssList(nil),
inference(split_conjunct,[status(thm)],[ax17]) ).
cnf(c_0_22,negated_conjecture,
ssList(esk2_0),
inference(split_conjunct,[status(thm)],[c_0_8]) ).
fof(c_0_23,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_24,negated_conjecture,
( ~ neq(esk4_0,nil)
| ssItem(esk5_0) ),
inference(split_conjunct,[status(thm)],[c_0_8]) ).
cnf(c_0_25,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(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_19,c_0_20]),c_0_21]),c_0_22])]) ).
cnf(c_0_26,plain,
( ~ ssItem(X2)
| ~ ssList(X1)
| ssList(cons(X2,X1)) ),
inference(split_conjunct,[status(thm)],[c_0_23]) ).
cnf(c_0_27,negated_conjecture,
ssItem(esk5_0),
inference(cn,[status(thm)],[inference(rw,[status(thm)],[inference(rw,[status(thm)],[c_0_24,c_0_13]),c_0_14])]) ).
fof(c_0_28,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_29,negated_conjecture,
( ~ segmentP(esk2_0,esk1_0)
| ~ neq(esk4_0,nil) ),
inference(split_conjunct,[status(thm)],[c_0_8]) ).
cnf(c_0_30,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_25,c_0_26]),c_0_21]),c_0_27])]) ).
cnf(c_0_31,plain,
( ~ ssList(X1)
| segmentP(X1,X1) ),
inference(split_conjunct,[status(thm)],[c_0_28]) ).
cnf(c_0_32,negated_conjecture,
~ segmentP(esk2_0,esk1_0),
inference(cn,[status(thm)],[inference(rw,[status(thm)],[inference(rw,[status(thm)],[c_0_29,c_0_13]),c_0_14])]) ).
cnf(c_0_33,negated_conjecture,
$false,
inference(sr,[status(thm)],[inference(cn,[status(thm)],[inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_30,c_0_31]),c_0_17])]),c_0_32]),
[proof] ).
%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.00/0.03 % Problem : SWC364+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.11/0.99 % Computer : n002.cluster.edu
% 0.11/0.99 % Model : x86_64 x86_64
% 0.11/0.99 % CPU : Intel(R) Xeon(R) CPU E5-2620 v4 @ 2.10GHz
% 0.11/0.99 % Memory : 8046.5625MB
% 0.11/0.99 % OS : Linux 6.8.0-71-generic
% 0.11/0.99 % CPULimit : 300
% 0.11/0.99 % WCLimit : 300
% 0.11/0.99 % DateTime : Mon Sep 21 08:21:32 UTC 2026
% 0.11/0.99 % CPUTime :
% 0.11/0.99 Running run_E /export/starexec/sandbox/benchmark/theBenchmark.p 300 THM
% 0.11/1.04 Running first-order theorem proving
% 0.11/1.04 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.18/1.07 % Version: 3.5.1
% 0.18/1.07 % Preprocessing class: FSLSSMSSSSSNFFN.
% 0.18/1.07 % Scheduled 4 strats onto 8 cores with 300 seconds (2400 total)
% 0.18/1.07 % Starting G-E--_207_C18_F1_SE_CS_SP_PI_PS_S5PRR_S2S with 1500s (5) cores
% 0.18/1.07 % Starting new_bool_3 with 300s (1) cores
% 0.18/1.07 % Starting new_bool_1 with 300s (1) cores
% 0.18/1.07 % Starting sh5l with 300s (1) cores
% 0.18/1.07 % new_bool_1 with pid 2856090 completed with status 0
% 0.18/1.07 % Result found by new_bool_1
% 0.18/1.07 % Preprocessing class: FSLSSMSSSSSNFFN.
% 0.18/1.07 % Scheduled 4 strats onto 8 cores with 300 seconds (2400 total)
% 0.18/1.07 % Starting G-E--_207_C18_F1_SE_CS_SP_PI_PS_S5PRR_S2S with 1500s (5) cores
% 0.18/1.07 % Starting new_bool_3 with 300s (1) cores
% 0.18/1.07 % Starting new_bool_1 with 300s (1) cores
% 0.18/1.07 % (lift_lambdas = 0, lambda_to_forall = 0,unroll_only_formulas = 0, sine = GSinE(CountFormulas,hypos,1.5,,3,20000,1.0))
% 0.18/1.07 % SinE strategy is GSinE(CountFormulas,hypos,1.5,,3,20000,1.0)
% 0.18/1.07 % Search class: FGHSF-FFMM21-MFFFFFNN
% 0.18/1.07 % Scheduled 5 strats onto 1 cores with 300 seconds (300 total)
% 0.18/1.07 % Starting SubtermCWHack with 31s (1) cores
% 0.18/1.07 % SubtermCWHack with pid 2856093 completed with status 0
% 0.18/1.07 % Result found by SubtermCWHack
% 0.18/1.07 % Preprocessing class: FSLSSMSSSSSNFFN.
% 0.18/1.07 % Scheduled 4 strats onto 8 cores with 300 seconds (2400 total)
% 0.18/1.07 % Starting G-E--_207_C18_F1_SE_CS_SP_PI_PS_S5PRR_S2S with 1500s (5) cores
% 0.18/1.07 % Starting new_bool_3 with 300s (1) cores
% 0.18/1.07 % Starting new_bool_1 with 300s (1) cores
% 0.18/1.07 % (lift_lambdas = 0, lambda_to_forall = 0,unroll_only_formulas = 0, sine = GSinE(CountFormulas,hypos,1.5,,3,20000,1.0))
% 0.18/1.07 % SinE strategy is GSinE(CountFormulas,hypos,1.5,,3,20000,1.0)
% 0.18/1.07 % Search class: FGHSF-FFMM21-MFFFFFNN
% 0.18/1.07 % Scheduled 5 strats onto 1 cores with 300 seconds (300 total)
% 0.18/1.07 % Starting SubtermCWHack with 31s (1) cores
% 0.18/1.07 % Preprocessing time : 0.001 s
% 0.18/1.07
% 0.18/1.07 % Proof found!
% 0.18/1.07 % SZS status Theorem
% 0.18/1.07 % SZS output start CNFRefutation
% See solution above
% 0.18/1.07 % Parsed axioms : 96
% 0.18/1.07 % Removed by relevancy pruning/SinE : 70
% 0.18/1.07 % Initial clauses : 52
% 0.18/1.07 % Removed in clause preprocessing : 0
% 0.18/1.07 % Initial clauses in saturation : 52
% 0.18/1.07 % Processed clauses : 294
% 0.18/1.07 % ...of these trivial : 7
% 0.18/1.07 % ...subsumed : 138
% 0.18/1.07 % ...remaining for further processing : 149
% 0.18/1.07 % Other redundant clauses eliminated : 18
% 0.18/1.07 % Clauses deleted for lack of memory : 0
% 0.18/1.07 % Backward-subsumed : 16
% 0.18/1.07 % Backward-rewritten : 6
% 0.18/1.07 % Generated clauses : 650
% 0.18/1.07 % ...of the previous two non-redundant : 501
% 0.18/1.07 % ...aggressively subsumed : 0
% 0.18/1.07 % Contextual simplify-reflections : 16
% 0.18/1.07 % Paramodulations : 628
% 0.18/1.07 % Factorizations : 0
% 0.18/1.07 % NegExts : 0
% 0.18/1.07 % Equation resolutions : 23
% 0.18/1.07 % Disequality decompositions : 0
% 0.18/1.07 % Total rewrite steps : 610
% 0.18/1.07 % ...of those cached : 595
% 0.18/1.07 % Propositional unsat checks : 0
% 0.18/1.07 % Propositional check models : 0
% 0.18/1.07 % Propositional check unsatisfiable : 0
% 0.18/1.07 % Propositional clauses : 0
% 0.18/1.07 % Propositional clauses after purity: 0
% 0.18/1.07 % Propositional unsat core size : 0
% 0.18/1.07 % Propositional preprocessing time : 0.000
% 0.18/1.07 % Propositional encoding time : 0.000
% 0.18/1.07 % Propositional solver time : 0.000
% 0.18/1.07 % Success case prop preproc time : 0.000
% 0.18/1.07 % Success case prop encoding time : 0.000
% 0.18/1.07 % Success case prop solver time : 0.000
% 0.18/1.07 % Current number of processed clauses : 122
% 0.18/1.07 % Positive orientable unit clauses : 19
% 0.18/1.07 % Positive unorientable unit clauses: 0
% 0.18/1.07 % Negative unit clauses : 8
% 0.18/1.07 % Non-unit-clauses : 95
% 0.18/1.07 % Current number of unprocessed clauses: 248
% 0.18/1.07 % ...number of literals in the above : 1380
% 0.18/1.07 % Current number of archived formulas : 0
% 0.18/1.07 % Current number of archived clauses : 22
% 0.18/1.07 % Clause-clause subsumption calls (NU) : 2263
% 0.18/1.07 % Rec. Clause-clause subsumption calls : 960
% 0.18/1.07 % Non-unit clause-clause subsumptions : 145
% 0.18/1.07 % Unit Clause-clause subsumption calls : 114
% 0.18/1.07 % Rewrite failures with RHS unbound : 0
% 0.18/1.07 % BW rewrite match attempts : 5
% 0.18/1.07 % BW rewrite match successes : 5
% 0.18/1.07 % Condensation attempts : 0
% 0.18/1.07 % Condensation successes : 0
% 0.18/1.07 % Termbank termtop insertions : 15316
% 0.18/1.07 % Search garbage collected termcells : 1512
% 0.18/1.07
% 0.18/1.07 % -------------------------------------------------
% 0.18/1.07 % User time : 0.014 s
% 0.18/1.07 % System time : 0.002 s
% 0.18/1.07 % Total time : 0.017 s
% 0.18/1.07 % Maximum resident set size: 3756 pages
% 0.18/1.07
% 0.18/1.07 % -------------------------------------------------
% 0.18/1.07 % User time : 0.018 s
% 0.18/1.07 % System time : 0.007 s
% 0.18/1.07 % Total time : 0.025 s
% 0.18/1.07 % Maximum resident set size: 4608 pages
% 0.18/1.07 % E exiting
%------------------------------------------------------------------------------