%------------------------------------------------------------------------------
% File : E---3.5.1
% Problem : SWC357+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 : n018.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:04 PM UTC 2026
% Result : Theorem 0.19s 0.52s
% Output : CNFRefutation 0.19s
% Verified :
% SZS Type : Refutation
% Derivation depth : 10
% Number of leaves : 6
% Syntax : Number of formulae : 35 ( 13 unt; 0 def)
% Number of atoms : 148 ( 39 equ)
% Maximal formula atoms : 18 ( 4 avg)
% Number of connectives : 185 ( 72 ~; 71 |; 22 &)
% ( 2 <=>; 18 =>; 0 <=; 0 <~>)
% Maximal formula depth : 17 ( 5 avg)
% Maximal term depth : 4 ( 1 avg)
% Number of predicates : 6 ( 4 usr; 1 prp; 0-2 aty)
% Number of functors : 9 ( 9 usr; 5 con; 0-2 aty)
% Number of variables : 44 ( 0 sgn 27 !; 3 ?)
% Comments :
%------------------------------------------------------------------------------
fof(co1,conjecture,
! [X1] :
( ssList(X1)
=> ! [X2] :
( ssList(X2)
=> ! [X3] :
( ssList(X3)
=> ! [X4] :
( ssList(X4)
=> ( ( ( ~ frontsegP(X4,X3)
| ~ neq(X3,nil) )
& ( nil != X3
| nil != X4 ) )
| segmentP(X2,X1)
| ~ neq(X2,nil)
| X1 != X3
| X2 != X4 ) ) ) ) ),
file('/export/starexec/sandbox/benchmark/theBenchmark.p',co1) ).
fof(ax7,axiom,
! [X1] :
( ssList(X1)
=> ! [X2] :
( ssList(X2)
=> ( segmentP(X1,X2)
<=> ? [X3] :
( ? [X4] :
( app(app(X3,X2),X4) = X1
& ssList(X4) )
& ssList(X3) ) ) ) ),
file('/export/starexec/sandbox/benchmark/Axioms/SWC001+0.ax',ax7) ).
fof(ax28,axiom,
! [X1] :
( ssList(X1)
=> app(nil,X1) = X1 ),
file('/export/starexec/sandbox/benchmark/Axioms/SWC001+0.ax',ax28) ).
fof(ax5,axiom,
! [X1] :
( ssList(X1)
=> ! [X2] :
( ssList(X2)
=> ( frontsegP(X1,X2)
<=> ? [X3] :
( app(X2,X3) = X1
& ssList(X3) ) ) ) ),
file('/export/starexec/sandbox/benchmark/Axioms/SWC001+0.ax',ax5) ).
fof(ax17,axiom,
ssList(nil),
file('/export/starexec/sandbox/benchmark/Axioms/SWC001+0.ax',ax17) ).
fof(ax57,axiom,
! [X1] :
( ssList(X1)
=> segmentP(X1,nil) ),
file('/export/starexec/sandbox/benchmark/Axioms/SWC001+0.ax',ax57) ).
fof(c_0_6,negated_conjecture,
~ ! [X1] :
( ssList(X1)
=> ! [X2] :
( ssList(X2)
=> ! [X3] :
( ssList(X3)
=> ! [X4] :
( ssList(X4)
=> ( ( ( ~ frontsegP(X4,X3)
| ~ neq(X3,nil) )
& ( nil != X3
| nil != X4 ) )
| segmentP(X2,X1)
| ~ 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)
=> ( ( ( ~ frontsegP(X4,X3)
| ~ neq(X3,nil) )
& ( nil != X3
| nil != X4 ) )
| segmentP(X2,X1)
| ~ neq(X2,nil)
| X1 != X3
| X2 != X4 ) ) ) ) ),
inference(fof_simplification,[status(thm)],[c_0_6]) ).
fof(c_0_8,negated_conjecture,
( ( nil = esk50_0
| frontsegP(esk51_0,esk50_0) )
& ( nil = esk50_0
| neq(esk50_0,nil) )
& ( nil = esk51_0
| frontsegP(esk51_0,esk50_0) )
& ( nil = esk51_0
| neq(esk50_0,nil) )
& ~ segmentP(esk49_0,esk48_0)
& neq(esk49_0,nil)
& esk48_0 = esk50_0
& esk49_0 = esk51_0
& ssList(esk51_0)
& ssList(esk50_0)
& ssList(esk49_0)
& ssList(esk48_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,
! [X28,X29,X32,X33] :
( ( ~ ssList(X28)
| ~ ssList(X29)
| segmentP(X28,X29)
| app(app(X32,X29),X33) != X28
| ~ ssList(X33)
| ~ ssList(X32) )
& ( ~ ssList(X28)
| ~ ssList(X29)
| ~ segmentP(X28,X29)
| app(app(esk8_2(X28,X29),X29),esk9_2(X28,X29)) = X28 )
& ( ~ ssList(X28)
| ~ ssList(X29)
| ~ segmentP(X28,X29)
| ssList(esk9_2(X28,X29)) )
& ( ~ ssList(X28)
| ~ ssList(X29)
| ~ segmentP(X28,X29)
| ssList(esk8_2(X28,X29)) ) ),
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)],[ax7])])])])])]) ).
fof(c_0_10,plain,
! [X135] :
( app(nil,X135) = X135
| ~ ssList(X135) ),
inference(fof_nnf,[status(thm)],[inference(variable_rename,[status(thm)],[inference(fof_nnf,[status(thm)],[ax28])])]) ).
fof(c_0_11,plain,
! [X20,X21,X23] :
( ( ~ ssList(X20)
| ~ ssList(X21)
| frontsegP(X20,X21)
| app(X21,X23) != X20
| ~ ssList(X23) )
& ( ~ ssList(X20)
| ~ ssList(X21)
| ~ frontsegP(X20,X21)
| app(X21,esk6_2(X20,X21)) = X20 )
& ( ~ ssList(X20)
| ~ ssList(X21)
| ~ frontsegP(X20,X21)
| ssList(esk6_2(X20,X21)) ) ),
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)],[ax5])])])])])]) ).
cnf(c_0_12,negated_conjecture,
ssList(esk49_0),
inference(split_conjunct,[status(thm)],[c_0_8]) ).
cnf(c_0_13,negated_conjecture,
esk49_0 = esk51_0,
inference(split_conjunct,[status(thm)],[c_0_8]) ).
cnf(c_0_14,negated_conjecture,
ssList(esk48_0),
inference(split_conjunct,[status(thm)],[c_0_8]) ).
cnf(c_0_15,negated_conjecture,
esk48_0 = esk50_0,
inference(split_conjunct,[status(thm)],[c_0_8]) ).
cnf(c_0_16,plain,
( ~ ssList(X4)
| ~ ssList(X3)
| app(app(X1,X3),X2) != X4
| ~ ssList(X2)
| ~ ssList(X1)
| segmentP(X4,X3) ),
inference(split_conjunct,[status(thm)],[c_0_9]) ).
cnf(c_0_17,plain,
( ~ ssList(X1)
| app(nil,X1) = X1 ),
inference(split_conjunct,[status(thm)],[c_0_10]) ).
cnf(c_0_18,plain,
ssList(nil),
inference(split_conjunct,[status(thm)],[ax17]) ).
cnf(c_0_19,plain,
( ~ ssList(X2)
| ~ ssList(X1)
| ~ frontsegP(X2,X1)
| app(X1,esk6_2(X2,X1)) = X2 ),
inference(split_conjunct,[status(thm)],[c_0_11]) ).
cnf(c_0_20,negated_conjecture,
( nil = esk50_0
| frontsegP(esk51_0,esk50_0) ),
inference(split_conjunct,[status(thm)],[c_0_8]) ).
cnf(c_0_21,negated_conjecture,
ssList(esk51_0),
inference(rw,[status(thm)],[c_0_12,c_0_13]) ).
cnf(c_0_22,negated_conjecture,
ssList(esk50_0),
inference(rw,[status(thm)],[c_0_14,c_0_15]) ).
cnf(c_0_23,plain,
( ~ ssList(X1)
| ~ ssList(X2)
| ~ frontsegP(X1,X2)
| ssList(esk6_2(X1,X2)) ),
inference(split_conjunct,[status(thm)],[c_0_11]) ).
cnf(c_0_24,plain,
( ~ ssList(X3)
| ~ ssList(X2)
| ~ ssList(X1)
| app(X2,X3) != X1
| segmentP(X1,X2) ),
inference(cn,[status(thm)],[inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_16,c_0_17]),c_0_18])]) ).
cnf(c_0_25,negated_conjecture,
( esk50_0 = nil
| app(esk50_0,esk6_2(esk51_0,esk50_0)) = esk51_0 ),
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,negated_conjecture,
( ssList(esk6_2(esk51_0,esk50_0))
| esk50_0 = nil ),
inference(cn,[status(thm)],[inference(rw,[status(thm)],[inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_23,c_0_20]),c_0_22]),c_0_21])]) ).
cnf(c_0_27,negated_conjecture,
~ segmentP(esk49_0,esk48_0),
inference(split_conjunct,[status(thm)],[c_0_8]) ).
cnf(c_0_28,negated_conjecture,
( ~ ssList(X1)
| esk51_0 != X1
| segmentP(X1,esk50_0)
| esk50_0 = nil ),
inference(csr,[status(thm)],[inference(cn,[status(thm)],[inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_24,c_0_25]),c_0_22])]),c_0_26]) ).
cnf(c_0_29,negated_conjecture,
~ segmentP(esk51_0,esk50_0),
inference(rw,[status(thm)],[inference(rw,[status(thm)],[c_0_27,c_0_13]),c_0_15]) ).
cnf(c_0_30,negated_conjecture,
esk50_0 = nil,
inference(sr,[status(thm)],[inference(cn,[status(thm)],[inference(rw,[status(thm)],[inference(er,[status(thm)],[c_0_28]),c_0_21])]),c_0_29]) ).
fof(c_0_31,plain,
! [X194] :
( segmentP(X194,nil)
| ~ ssList(X194) ),
inference(fof_nnf,[status(thm)],[inference(variable_rename,[status(thm)],[inference(fof_nnf,[status(thm)],[ax57])])]) ).
cnf(c_0_32,negated_conjecture,
~ segmentP(esk51_0,nil),
inference(rw,[status(thm)],[c_0_29,c_0_30]) ).
cnf(c_0_33,plain,
( ~ ssList(X1)
| segmentP(X1,nil) ),
inference(split_conjunct,[status(thm)],[c_0_31]) ).
cnf(c_0_34,negated_conjecture,
$false,
inference(cn,[status(thm)],[inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_32,c_0_33]),c_0_21])]),
[proof] ).
%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.00/0.03 % Problem : SWC357+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.37 % Computer : n018.cluster.edu
% 0.11/0.37 % Model : x86_64 x86_64
% 0.11/0.37 % CPU : Intel(R) Xeon(R) CPU E5-2620 v4 @ 2.10GHz
% 0.11/0.37 % Memory : 8046.5625MB
% 0.11/0.37 % OS : Linux 6.8.0-71-generic
% 0.11/0.37 % CPULimit : 300
% 0.11/0.37 % WCLimit : 300
% 0.11/0.37 % DateTime : Mon Sep 21 08:20:14 UTC 2026
% 0.11/0.38 % CPUTime :
% 0.11/0.38 Running run_E /export/starexec/sandbox/benchmark/theBenchmark.p 300 THM
% 0.15/0.42 Running first-order theorem proving
% 0.15/0.42 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.19/0.52 % Version: 3.5.1
% 0.19/0.52 % Preprocessing class: FSLSSMSSSSSNFFN.
% 0.19/0.52 % Scheduled 4 strats onto 8 cores with 300 seconds (2400 total)
% 0.19/0.52 % Starting G-E--_207_C18_F1_SE_CS_SP_PI_PS_S5PRR_S2S with 1500s (5) cores
% 0.19/0.52 % Starting new_bool_3 with 300s (1) cores
% 0.19/0.52 % Starting new_bool_1 with 300s (1) cores
% 0.19/0.52 % Starting sh5l with 300s (1) cores
% 0.19/0.52 % G-E--_207_C18_F1_SE_CS_SP_PI_PS_S5PRR_S2S with pid 1428682 completed with status 0
% 0.19/0.52 % Result found by G-E--_207_C18_F1_SE_CS_SP_PI_PS_S5PRR_S2S
% 0.19/0.52 % Preprocessing class: FSLSSMSSSSSNFFN.
% 0.19/0.52 % Scheduled 4 strats onto 8 cores with 300 seconds (2400 total)
% 0.19/0.52 % Starting G-E--_207_C18_F1_SE_CS_SP_PI_PS_S5PRR_S2S with 1500s (5) cores
% 0.19/0.52 % (lift_lambdas = 1, lambda_to_forall = 1,unroll_only_formulas = 1, sine = Auto)
% 0.19/0.52 % No SInE strategy applied
% 0.19/0.52 % Search class: FGHSF-FSLM21-MFFFFFNN
% 0.19/0.52 % Scheduled 11 strats onto 5 cores with 1500 seconds (1500 total)
% 0.19/0.52 % Starting SubtermCWHack with 136s (1) cores
% 0.19/0.52 % Starting G-E--_207_C18_F1_SE_CS_SP_PI_PS_S5PRR_S2S with 151s (1) cores
% 0.19/0.52 % Starting G-E--_008_C45_F1_PI_AE_Q4_CS_SP_S4d with 136s (1) cores
% 0.19/0.52 % Starting G-E--_110_C45_F1_PI_SE_CS_SP_PS_S4S with 136s (1) cores
% 0.19/0.52 % Starting G-E--_208_C18_F1_SE_CS_SP_PS_TT_S0Y with 136s (1) cores
% 0.19/0.52 % G-E--_008_C45_F1_PI_AE_Q4_CS_SP_S4d with pid 1428691 completed with status 0
% 0.19/0.52 % Result found by G-E--_008_C45_F1_PI_AE_Q4_CS_SP_S4d
% 0.19/0.52 % Preprocessing class: FSLSSMSSSSSNFFN.
% 0.19/0.52 % Scheduled 4 strats onto 8 cores with 300 seconds (2400 total)
% 0.19/0.52 % Starting G-E--_207_C18_F1_SE_CS_SP_PI_PS_S5PRR_S2S with 1500s (5) cores
% 0.19/0.52 % (lift_lambdas = 1, lambda_to_forall = 1,unroll_only_formulas = 1, sine = Auto)
% 0.19/0.52 % No SInE strategy applied
% 0.19/0.52 % Search class: FGHSF-FSLM21-MFFFFFNN
% 0.19/0.52 % Scheduled 11 strats onto 5 cores with 1500 seconds (1500 total)
% 0.19/0.52 % Starting SubtermCWHack with 136s (1) cores
% 0.19/0.52 % Starting G-E--_207_C18_F1_SE_CS_SP_PI_PS_S5PRR_S2S with 151s (1) cores
% 0.19/0.52 % Starting G-E--_008_C45_F1_PI_AE_Q4_CS_SP_S4d with 136s (1) cores
% 0.19/0.52 % Preprocessing time : 0.002 s
% 0.19/0.52
% 0.19/0.52 % Proof found!
% 0.19/0.52 % SZS status Theorem
% 0.19/0.52 % SZS output start CNFRefutation
% See solution above
% 0.19/0.52 % Parsed axioms : 96
% 0.19/0.52 % Removed by relevancy pruning/SinE : 0
% 0.19/0.52 % Initial clauses : 202
% 0.19/0.52 % Removed in clause preprocessing : 2
% 0.19/0.52 % Initial clauses in saturation : 200
% 0.19/0.52 % Processed clauses : 1073
% 0.19/0.52 % ...of these trivial : 6
% 0.19/0.52 % ...subsumed : 575
% 0.19/0.52 % ...remaining for further processing : 492
% 0.19/0.52 % Other redundant clauses eliminated : 104
% 0.19/0.52 % Clauses deleted for lack of memory : 0
% 0.19/0.52 % Backward-subsumed : 15
% 0.19/0.52 % Backward-rewritten : 130
% 0.19/0.52 % Generated clauses : 2510
% 0.19/0.52 % ...of the previous two non-redundant : 2176
% 0.19/0.52 % ...aggressively subsumed : 0
% 0.19/0.52 % Contextual simplify-reflections : 201
% 0.19/0.52 % Paramodulations : 2351
% 0.19/0.52 % Factorizations : 0
% 0.19/0.52 % NegExts : 0
% 0.19/0.52 % Equation resolutions : 159
% 0.19/0.52 % Disequality decompositions : 0
% 0.19/0.52 % Total rewrite steps : 1505
% 0.19/0.52 % ...of those cached : 1492
% 0.19/0.52 % Propositional unsat checks : 0
% 0.19/0.52 % Propositional check models : 0
% 0.19/0.52 % Propositional check unsatisfiable : 0
% 0.19/0.52 % Propositional clauses : 0
% 0.19/0.52 % Propositional clauses after purity: 0
% 0.19/0.52 % Propositional unsat core size : 0
% 0.19/0.52 % Propositional preprocessing time : 0.000
% 0.19/0.52 % Propositional encoding time : 0.000
% 0.19/0.52 % Propositional solver time : 0.000
% 0.19/0.52 % Success case prop preproc time : 0.000
% 0.19/0.52 % Success case prop encoding time : 0.000
% 0.19/0.52 % Success case prop solver time : 0.000
% 0.19/0.52 % Current number of processed clauses : 341
% 0.19/0.52 % Positive orientable unit clauses : 23
% 0.19/0.52 % Positive unorientable unit clauses: 0
% 0.19/0.52 % Negative unit clauses : 3
% 0.19/0.52 % Non-unit-clauses : 315
% 0.19/0.52 % Current number of unprocessed clauses: 1287
% 0.19/0.52 % ...number of literals in the above : 7974
% 0.19/0.52 % Current number of archived formulas : 0
% 0.19/0.52 % Current number of archived clauses : 145
% 0.19/0.52 % Clause-clause subsumption calls (NU) : 44226
% 0.19/0.52 % Rec. Clause-clause subsumption calls : 15815
% 0.19/0.52 % Non-unit clause-clause subsumptions : 790
% 0.19/0.52 % Unit Clause-clause subsumption calls : 107
% 0.19/0.52 % Rewrite failures with RHS unbound : 0
% 0.19/0.52 % BW rewrite match attempts : 3
% 0.19/0.52 % BW rewrite match successes : 3
% 0.19/0.52 % Condensation attempts : 0
% 0.19/0.52 % Condensation successes : 0
% 0.19/0.52 % Termbank termtop insertions : 60607
% 0.19/0.52 % Search garbage collected termcells : 4240
% 0.19/0.52
% 0.19/0.52 % -------------------------------------------------
% 0.19/0.52 % User time : 0.070 s
% 0.19/0.52 % System time : 0.002 s
% 0.19/0.52 % Total time : 0.072 s
% 0.19/0.52 % Maximum resident set size: 4012 pages
% 0.19/0.52
% 0.19/0.52 % -------------------------------------------------
% 0.19/0.52 % User time : 0.276 s
% 0.19/0.52 % System time : 0.017 s
% 0.19/0.52 % Total time : 0.293 s
% 0.19/0.52 % Maximum resident set size: 4608 pages
% 0.19/0.52 % E exiting
%------------------------------------------------------------------------------