%------------------------------------------------------------------------------
% File : E---3.5.1
% Problem : SWC339+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 : n009.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:59 PM UTC 2026
% Result : Theorem 0.23s 5.69s
% Output : CNFRefutation 0.23s
% Verified :
% SZS Type : Refutation
% Derivation depth : 7
% Number of leaves : 3
% Syntax : Number of formulae : 22 ( 10 unt; 0 def)
% Number of atoms : 151 ( 39 equ)
% Maximal formula atoms : 28 ( 6 avg)
% Number of connectives : 181 ( 52 ~; 50 |; 55 &)
% ( 0 <=>; 24 =>; 0 <=; 0 <~>)
% Maximal formula depth : 30 ( 8 avg)
% Maximal term depth : 3 ( 1 avg)
% Number of predicates : 7 ( 5 usr; 1 prp; 0-2 aty)
% Number of functors : 9 ( 9 usr; 7 con; 0-2 aty)
% Number of variables : 66 ( 0 sgn 36 !; 24 ?)
% Comments :
%------------------------------------------------------------------------------
fof(co1,conjecture,
! [X1] :
( ssList(X1)
=> ! [X2] :
( ssList(X2)
=> ! [X3] :
( ssList(X3)
=> ! [X4] :
( ssList(X4)
=> ( ( totalorderedP(X1)
& segmentP(X2,X1) )
| ( nil = X3
& nil != X4 )
| ! [X5] :
( ssList(X5)
=> ! [X6] :
( ssList(X6)
=> ( ? [X11] :
( ? [X12] :
( ? [X13] :
( ? [X14] :
( leq(X13,X11)
& app(X14,cons(X13,nil)) = X3
& ssList(X14) )
& ssItem(X13) )
& app(cons(X11,nil),X12) = X6
& ssList(X12) )
& ssItem(X11) )
| ? [X7] :
( ? [X8] :
( ? [X9] :
( ? [X10] :
( leq(X7,X9)
& app(cons(X9,nil),X10) = X3
& ssList(X10) )
& ssItem(X9) )
& app(X8,cons(X7,nil)) = X5
& ssList(X8) )
& ssItem(X7) )
| ~ totalorderedP(X3)
| app(app(X5,X3),X6) != X4 ) ) )
| 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(ax55,axiom,
! [X1] :
( ssList(X1)
=> segmentP(X1,X1) ),
file('/export/starexec/sandbox/benchmark/Axioms/SWC001+0.ax',ax55) ).
fof(c_0_3,negated_conjecture,
~ ! [X1] :
( ssList(X1)
=> ! [X2] :
( ssList(X2)
=> ! [X3] :
( ssList(X3)
=> ! [X4] :
( ssList(X4)
=> ( ( totalorderedP(X1)
& segmentP(X2,X1) )
| ( nil = X3
& nil != X4 )
| ! [X5] :
( ssList(X5)
=> ! [X6] :
( ssList(X6)
=> ( ? [X11] :
( ? [X12] :
( ? [X13] :
( ? [X14] :
( leq(X13,X11)
& app(X14,cons(X13,nil)) = X3
& ssList(X14) )
& ssItem(X13) )
& app(cons(X11,nil),X12) = X6
& ssList(X12) )
& ssItem(X11) )
| ? [X7] :
( ? [X8] :
( ? [X9] :
( ? [X10] :
( leq(X7,X9)
& app(cons(X9,nil),X10) = X3
& ssList(X10) )
& ssItem(X9) )
& app(X8,cons(X7,nil)) = X5
& ssList(X8) )
& ssItem(X7) )
| ~ totalorderedP(X3)
| app(app(X5,X3),X6) != X4 ) ) )
| X1 != X3
| X2 != X4 ) ) ) ) ),
inference(assume_negation,[status(cth)],[co1]) ).
fof(c_0_4,negated_conjecture,
~ ! [X1] :
( ssList(X1)
=> ! [X2] :
( ssList(X2)
=> ! [X3] :
( ssList(X3)
=> ! [X4] :
( ssList(X4)
=> ( ( totalorderedP(X1)
& segmentP(X2,X1) )
| ( nil = X3
& nil != X4 )
| ! [X5] :
( ssList(X5)
=> ! [X6] :
( ssList(X6)
=> ( ? [X11] :
( ? [X12] :
( ? [X13] :
( ? [X14] :
( leq(X13,X11)
& app(X14,cons(X13,nil)) = X3
& ssList(X14) )
& ssItem(X13) )
& app(cons(X11,nil),X12) = X6
& ssList(X12) )
& ssItem(X11) )
| ? [X7] :
( ? [X8] :
( ? [X9] :
( ? [X10] :
( leq(X7,X9)
& app(cons(X9,nil),X10) = X3
& ssList(X10) )
& ssItem(X9) )
& app(X8,cons(X7,nil)) = X5
& ssList(X8) )
& ssItem(X7) )
| ~ totalorderedP(X3)
| app(app(X5,X3),X6) != X4 ) ) )
| X1 != X3
| X2 != X4 ) ) ) ) ),
inference(fof_simplification,[status(thm)],[c_0_3]) ).
fof(c_0_5,negated_conjecture,
! [X21,X22,X23,X24,X25,X26,X27,X28] :
( ( ~ totalorderedP(esk1_0)
| ~ segmentP(esk2_0,esk1_0) )
& ( nil != esk3_0
| nil = esk4_0 )
& ( ~ leq(X27,X25)
| app(X28,cons(X27,nil)) != esk3_0
| ~ ssList(X28)
| ~ ssItem(X27)
| app(cons(X25,nil),X26) != esk6_0
| ~ ssList(X26)
| ~ ssItem(X25) )
& ( ~ leq(X21,X23)
| app(cons(X23,nil),X24) != esk3_0
| ~ ssList(X24)
| ~ ssItem(X23)
| app(X22,cons(X21,nil)) != esk5_0
| ~ ssList(X22)
| ~ ssItem(X21) )
& totalorderedP(esk3_0)
& app(app(esk5_0,esk3_0),esk6_0) = esk4_0
& ssList(esk6_0)
& ssList(esk5_0)
& 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_4])])])])]) ).
fof(c_0_6,plain,
! [X55,X56,X57,X58] :
( segmentP(app(app(X57,X55),X58),X56)
| ~ segmentP(X55,X56)
| ~ ssList(X58)
| ~ ssList(X57)
| ~ ssList(X56)
| ~ ssList(X55) ),
inference(fof_nnf,[status(thm)],[inference(shift_quantors,[status(thm)],[inference(variable_rename,[status(thm)],[inference(fof_nnf,[status(thm)],[ax56])])])]) ).
cnf(c_0_7,negated_conjecture,
( ~ totalorderedP(esk1_0)
| ~ segmentP(esk2_0,esk1_0) ),
inference(split_conjunct,[status(thm)],[c_0_5]) ).
cnf(c_0_8,negated_conjecture,
esk1_0 = esk3_0,
inference(split_conjunct,[status(thm)],[c_0_5]) ).
cnf(c_0_9,negated_conjecture,
totalorderedP(esk3_0),
inference(split_conjunct,[status(thm)],[c_0_5]) ).
cnf(c_0_10,negated_conjecture,
esk2_0 = esk4_0,
inference(split_conjunct,[status(thm)],[c_0_5]) ).
cnf(c_0_11,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_6]) ).
cnf(c_0_12,negated_conjecture,
app(app(esk5_0,esk3_0),esk6_0) = esk4_0,
inference(split_conjunct,[status(thm)],[c_0_5]) ).
cnf(c_0_13,negated_conjecture,
ssList(esk6_0),
inference(split_conjunct,[status(thm)],[c_0_5]) ).
cnf(c_0_14,negated_conjecture,
ssList(esk5_0),
inference(split_conjunct,[status(thm)],[c_0_5]) ).
cnf(c_0_15,negated_conjecture,
ssList(esk3_0),
inference(split_conjunct,[status(thm)],[c_0_5]) ).
cnf(c_0_16,negated_conjecture,
~ segmentP(esk4_0,esk3_0),
inference(cn,[status(thm)],[inference(rw,[status(thm)],[inference(rw,[status(thm)],[inference(rw,[status(thm)],[inference(rw,[status(thm)],[c_0_7,c_0_8]),c_0_9]),c_0_10]),c_0_8])]) ).
cnf(c_0_17,negated_conjecture,
( ~ ssList(X1)
| ~ segmentP(esk3_0,X1)
| segmentP(esk4_0,X1) ),
inference(cn,[status(thm)],[inference(rw,[status(thm)],[inference(rw,[status(thm)],[inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_11,c_0_12]),c_0_13]),c_0_14]),c_0_15])]) ).
fof(c_0_18,plain,
! [X54] :
( segmentP(X54,X54)
| ~ ssList(X54) ),
inference(fof_nnf,[status(thm)],[inference(variable_rename,[status(thm)],[inference(fof_nnf,[status(thm)],[ax55])])]) ).
cnf(c_0_19,negated_conjecture,
~ segmentP(esk3_0,esk3_0),
inference(cn,[status(thm)],[inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_16,c_0_17]),c_0_15])]) ).
cnf(c_0_20,plain,
( ~ ssList(X1)
| segmentP(X1,X1) ),
inference(split_conjunct,[status(thm)],[c_0_18]) ).
cnf(c_0_21,negated_conjecture,
$false,
inference(cn,[status(thm)],[inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_19,c_0_20]),c_0_15])]),
[proof] ).
%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.00/0.03 % Problem : SWC339+1 : TPTP v9.3.1. Released v2.4.0.
% 0.00/0.06 % Command : run_E /export/starexec/sandbox/benchmark/theBenchmark.p 300 THM
% 0.17/5.49 % Computer : n009.cluster.edu
% 0.17/5.49 % Model : x86_64 x86_64
% 0.17/5.49 % CPU : Intel(R) Xeon(R) CPU E5-2620 v4 @ 2.10GHz
% 0.17/5.49 % Memory : 8046.5625MB
% 0.17/5.49 % OS : Linux 6.8.0-71-generic
% 0.17/5.49 % CPULimit : 300
% 0.17/5.49 % WCLimit : 300
% 0.17/5.49 % DateTime : Mon Sep 21 08:17:17 UTC 2026
% 0.17/5.49 % CPUTime :
% 0.17/5.49 Running run_E /export/starexec/sandbox/benchmark/theBenchmark.p 300 THM
% 0.23/5.59 Running first-order theorem proving
% 0.23/5.60 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.23/5.69 % Version: 3.5.1
% 0.23/5.69 % Preprocessing class: FSLSSMSSSSSNFFN.
% 0.23/5.69 % Scheduled 4 strats onto 8 cores with 300 seconds (2400 total)
% 0.23/5.69 % Starting G-E--_207_C18_F1_SE_CS_SP_PI_PS_S5PRR_S2S with 1500s (5) cores
% 0.23/5.69 % Starting new_bool_3 with 300s (1) cores
% 0.23/5.69 % Starting new_bool_1 with 300s (1) cores
% 0.23/5.69 % Starting sh5l with 300s (1) cores
% 0.23/5.69 % new_bool_3 with pid 1292237 completed with status 0
% 0.23/5.69 % Result found by new_bool_3
% 0.23/5.69 % Preprocessing class: FSLSSMSSSSSNFFN.
% 0.23/5.69 % Scheduled 4 strats onto 8 cores with 300 seconds (2400 total)
% 0.23/5.69 % Starting G-E--_207_C18_F1_SE_CS_SP_PI_PS_S5PRR_S2S with 1500s (5) cores
% 0.23/5.69 % Starting new_bool_3 with 300s (1) cores
% 0.23/5.69 % (lift_lambdas = 0, lambda_to_forall = 0,unroll_only_formulas = 0, sine = GSinE(CountFormulas,hypos,1.5,,3,20000,1.0))
% 0.23/5.69 % SinE strategy is GSinE(CountFormulas,hypos,1.5,,3,20000,1.0)
% 0.23/5.69 % Search class: FGHSF-FFMM21-MFFFFFNN
% 0.23/5.69 % Scheduled 5 strats onto 1 cores with 300 seconds (300 total)
% 0.23/5.69 % Starting SubtermCWHack with 31s (1) cores
% 0.23/5.69 % SubtermCWHack with pid 1292240 completed with status 0
% 0.23/5.69 % Result found by SubtermCWHack
% 0.23/5.69 % Preprocessing class: FSLSSMSSSSSNFFN.
% 0.23/5.69 % Scheduled 4 strats onto 8 cores with 300 seconds (2400 total)
% 0.23/5.69 % Starting G-E--_207_C18_F1_SE_CS_SP_PI_PS_S5PRR_S2S with 1500s (5) cores
% 0.23/5.69 % Starting new_bool_3 with 300s (1) cores
% 0.23/5.69 % (lift_lambdas = 0, lambda_to_forall = 0,unroll_only_formulas = 0, sine = GSinE(CountFormulas,hypos,1.5,,3,20000,1.0))
% 0.23/5.69 % SinE strategy is GSinE(CountFormulas,hypos,1.5,,3,20000,1.0)
% 0.23/5.69 % Search class: FGHSF-FFMM21-MFFFFFNN
% 0.23/5.69 % Scheduled 5 strats onto 1 cores with 300 seconds (300 total)
% 0.23/5.69 % Starting SubtermCWHack with 31s (1) cores
% 0.23/5.69 % Preprocessing time : 0.004 s
% 0.23/5.69
% 0.23/5.69 % Proof found!
% 0.23/5.69 % SZS status Theorem
% 0.23/5.69 % SZS output start CNFRefutation
% See solution above
% 0.23/5.69 % Parsed axioms : 96
% 0.23/5.69 % Removed by relevancy pruning/SinE : 49
% 0.23/5.69 % Initial clauses : 86
% 0.23/5.69 % Removed in clause preprocessing : 1
% 0.23/5.69 % Initial clauses in saturation : 85
% 0.23/5.69 % Processed clauses : 266
% 0.23/5.69 % ...of these trivial : 0
% 0.23/5.69 % ...subsumed : 96
% 0.23/5.69 % ...remaining for further processing : 170
% 0.23/5.69 % Other redundant clauses eliminated : 28
% 0.23/5.69 % Clauses deleted for lack of memory : 0
% 0.23/5.69 % Backward-subsumed : 54
% 0.23/5.69 % Backward-rewritten : 3
% 0.23/5.69 % Generated clauses : 793
% 0.23/5.69 % ...of the previous two non-redundant : 599
% 0.23/5.69 % ...aggressively subsumed : 0
% 0.23/5.69 % Contextual simplify-reflections : 12
% 0.23/5.69 % Paramodulations : 761
% 0.23/5.69 % Factorizations : 0
% 0.23/5.69 % NegExts : 0
% 0.23/5.69 % Equation resolutions : 33
% 0.23/5.69 % Disequality decompositions : 0
% 0.23/5.69 % Total rewrite steps : 753
% 0.23/5.69 % ...of those cached : 743
% 0.23/5.69 % Propositional unsat checks : 0
% 0.23/5.69 % Propositional check models : 0
% 0.23/5.69 % Propositional check unsatisfiable : 0
% 0.23/5.69 % Propositional clauses : 0
% 0.23/5.69 % Propositional clauses after purity: 0
% 0.23/5.69 % Propositional unsat core size : 0
% 0.23/5.69 % Propositional preprocessing time : 0.000
% 0.23/5.69 % Propositional encoding time : 0.000
% 0.23/5.69 % Propositional solver time : 0.000
% 0.23/5.69 % Success case prop preproc time : 0.000
% 0.23/5.69 % Success case prop encoding time : 0.000
% 0.23/5.69 % Success case prop solver time : 0.000
% 0.23/5.69 % Current number of processed clauses : 108
% 0.23/5.69 % Positive orientable unit clauses : 16
% 0.23/5.69 % Positive unorientable unit clauses: 0
% 0.23/5.69 % Negative unit clauses : 7
% 0.23/5.69 % Non-unit-clauses : 85
% 0.23/5.69 % Current number of unprocessed clauses: 253
% 0.23/5.69 % ...number of literals in the above : 1342
% 0.23/5.69 % Current number of archived formulas : 0
% 0.23/5.69 % Current number of archived clauses : 57
% 0.23/5.69 % Clause-clause subsumption calls (NU) : 1689
% 0.23/5.69 % Rec. Clause-clause subsumption calls : 1202
% 0.23/5.69 % Non-unit clause-clause subsumptions : 114
% 0.23/5.69 % Unit Clause-clause subsumption calls : 114
% 0.23/5.69 % Rewrite failures with RHS unbound : 0
% 0.23/5.69 % BW rewrite match attempts : 3
% 0.23/5.69 % BW rewrite match successes : 3
% 0.23/5.69 % Condensation attempts : 0
% 0.23/5.69 % Condensation successes : 0
% 0.23/5.69 % Termbank termtop insertions : 19177
% 0.23/5.69 % Search garbage collected termcells : 2300
% 0.23/5.69
% 0.23/5.69 % -------------------------------------------------
% 0.23/5.69 % User time : 0.042 s
% 0.23/5.69 % System time : 0.004 s
% 0.23/5.69 % Total time : 0.046 s
% 0.23/5.69 % Maximum resident set size: 3512 pages
% 0.23/5.69
% 0.23/5.69 % -------------------------------------------------
% 0.23/5.69 % User time : 0.049 s
% 0.23/5.69 % System time : 0.011 s
% 0.23/5.69 % Total time : 0.060 s
% 0.23/5.69 % Maximum resident set size: 4608 pages
% 0.23/5.69 % E exiting
%------------------------------------------------------------------------------