%------------------------------------------------------------------------------
% File : E---3.5.1
% Problem : SWC347+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 : 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:01 PM UTC 2026
% Result : Theorem 0.18s 0.49s
% Output : CNFRefutation 0.18s
% Verified :
% SZS Type : Refutation
% Derivation depth : 7
% Number of leaves : 5
% Syntax : Number of formulae : 27 ( 11 unt; 0 def)
% Number of atoms : 131 ( 34 equ)
% Maximal formula atoms : 20 ( 4 avg)
% Number of connectives : 155 ( 51 ~; 47 |; 35 &)
% ( 0 <=>; 22 =>; 0 <=; 0 <~>)
% Maximal formula depth : 27 ( 7 avg)
% Maximal term depth : 3 ( 1 avg)
% Number of predicates : 7 ( 5 usr; 1 prp; 0-2 aty)
% Number of functors : 8 ( 8 usr; 6 con; 0-2 aty)
% Number of variables : 53 ( 0 sgn 31 !; 12 ?)
% Comments :
%------------------------------------------------------------------------------
fof(co1,conjecture,
! [X1] :
( ssList(X1)
=> ! [X2] :
( ssList(X2)
=> ! [X3] :
( ssList(X3)
=> ! [X4] :
( ssList(X4)
=> ( ( strictorderedP(X1)
& segmentP(X2,X1) )
| ( nil = X3
& nil != X4 )
| ! [X5] :
( ssList(X5)
=> ( ? [X6] :
( ? [X7] :
( ? [X8] :
( ? [X9] :
( lt(X8,X6)
& app(X9,cons(X8,nil)) = X3
& ssList(X9) )
& ssItem(X8) )
& app(cons(X6,nil),X7) = X5
& ssList(X7) )
& ssItem(X6) )
| ~ strictorderedP(X3)
| app(X3,X5) != X4 ) )
| 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(ax55,axiom,
! [X1] :
( ssList(X1)
=> segmentP(X1,X1) ),
file('/export/starexec/sandbox2/benchmark/Axioms/SWC001+0.ax',ax55) ).
fof(c_0_5,negated_conjecture,
~ ! [X1] :
( ssList(X1)
=> ! [X2] :
( ssList(X2)
=> ! [X3] :
( ssList(X3)
=> ! [X4] :
( ssList(X4)
=> ( ( strictorderedP(X1)
& segmentP(X2,X1) )
| ( nil = X3
& nil != X4 )
| ! [X5] :
( ssList(X5)
=> ( ? [X6] :
( ? [X7] :
( ? [X8] :
( ? [X9] :
( lt(X8,X6)
& app(X9,cons(X8,nil)) = X3
& ssList(X9) )
& ssItem(X8) )
& app(cons(X6,nil),X7) = X5
& ssList(X7) )
& ssItem(X6) )
| ~ strictorderedP(X3)
| app(X3,X5) != X4 ) )
| 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)
=> ( ( strictorderedP(X1)
& segmentP(X2,X1) )
| ( nil = X3
& nil != X4 )
| ! [X5] :
( ssList(X5)
=> ( ? [X6] :
( ? [X7] :
( ? [X8] :
( ? [X9] :
( lt(X8,X6)
& app(X9,cons(X8,nil)) = X3
& ssList(X9) )
& ssItem(X8) )
& app(cons(X6,nil),X7) = X5
& ssList(X7) )
& ssItem(X6) )
| ~ strictorderedP(X3)
| app(X3,X5) != X4 ) )
| X1 != X3
| X2 != X4 ) ) ) ) ),
inference(fof_simplification,[status(thm)],[c_0_5]) ).
fof(c_0_7,plain,
! [X45,X46,X47,X48] :
( segmentP(app(app(X47,X45),X48),X46)
| ~ segmentP(X45,X46)
| ~ ssList(X48)
| ~ ssList(X47)
| ~ ssList(X46)
| ~ ssList(X45) ),
inference(fof_nnf,[status(thm)],[inference(shift_quantors,[status(thm)],[inference(variable_rename,[status(thm)],[inference(fof_nnf,[status(thm)],[ax56])])])]) ).
fof(c_0_8,plain,
! [X74] :
( app(nil,X74) = X74
| ~ ssList(X74) ),
inference(fof_nnf,[status(thm)],[inference(variable_rename,[status(thm)],[inference(fof_nnf,[status(thm)],[ax28])])]) ).
fof(c_0_9,negated_conjecture,
! [X15,X16,X17,X18] :
( ( ~ strictorderedP(esk1_0)
| ~ segmentP(esk2_0,esk1_0) )
& ( nil != esk3_0
| nil = esk4_0 )
& ( ~ lt(X17,X15)
| app(X18,cons(X17,nil)) != esk3_0
| ~ ssList(X18)
| ~ ssItem(X17)
| app(cons(X15,nil),X16) != esk5_0
| ~ ssList(X16)
| ~ ssItem(X15) )
& strictorderedP(esk3_0)
& app(esk3_0,esk5_0) = esk4_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_6])])])])]) ).
cnf(c_0_10,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_7]) ).
cnf(c_0_11,plain,
( ~ ssList(X1)
| app(nil,X1) = X1 ),
inference(split_conjunct,[status(thm)],[c_0_8]) ).
cnf(c_0_12,plain,
ssList(nil),
inference(split_conjunct,[status(thm)],[ax17]) ).
cnf(c_0_13,negated_conjecture,
( ~ strictorderedP(esk1_0)
| ~ segmentP(esk2_0,esk1_0) ),
inference(split_conjunct,[status(thm)],[c_0_9]) ).
cnf(c_0_14,negated_conjecture,
esk1_0 = esk3_0,
inference(split_conjunct,[status(thm)],[c_0_9]) ).
cnf(c_0_15,negated_conjecture,
strictorderedP(esk3_0),
inference(split_conjunct,[status(thm)],[c_0_9]) ).
cnf(c_0_16,negated_conjecture,
esk2_0 = esk4_0,
inference(split_conjunct,[status(thm)],[c_0_9]) ).
cnf(c_0_17,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_10,c_0_11]),c_0_12])]) ).
cnf(c_0_18,negated_conjecture,
app(esk3_0,esk5_0) = esk4_0,
inference(split_conjunct,[status(thm)],[c_0_9]) ).
cnf(c_0_19,negated_conjecture,
ssList(esk5_0),
inference(split_conjunct,[status(thm)],[c_0_9]) ).
cnf(c_0_20,negated_conjecture,
ssList(esk3_0),
inference(split_conjunct,[status(thm)],[c_0_9]) ).
cnf(c_0_21,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_13,c_0_14]),c_0_15]),c_0_16]),c_0_14])]) ).
cnf(c_0_22,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(spm,[status(thm)],[c_0_17,c_0_18]),c_0_19]),c_0_20])]) ).
fof(c_0_23,plain,
! [X44] :
( segmentP(X44,X44)
| ~ ssList(X44) ),
inference(fof_nnf,[status(thm)],[inference(variable_rename,[status(thm)],[inference(fof_nnf,[status(thm)],[ax55])])]) ).
cnf(c_0_24,negated_conjecture,
~ segmentP(esk3_0,esk3_0),
inference(cn,[status(thm)],[inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_21,c_0_22]),c_0_20])]) ).
cnf(c_0_25,plain,
( ~ ssList(X1)
| segmentP(X1,X1) ),
inference(split_conjunct,[status(thm)],[c_0_23]) ).
cnf(c_0_26,negated_conjecture,
$false,
inference(cn,[status(thm)],[inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_24,c_0_25]),c_0_20])]),
[proof] ).
%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.00/0.03 % Problem : SWC347+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.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:19:59 UTC 2026
% 0.11/0.37 % CPUTime :
% 0.11/0.37 Running run_E /export/starexec/sandbox2/benchmark/theBenchmark.p 300 THM
% 0.14/0.42 Running first-order theorem proving
% 0.14/0.42 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.18/0.49 % Version: 3.5.1
% 0.18/0.49 % Preprocessing class: FSLSSMSSSSSNFFN.
% 0.18/0.49 % Scheduled 4 strats onto 8 cores with 300 seconds (2400 total)
% 0.18/0.49 % Starting G-E--_207_C18_F1_SE_CS_SP_PI_PS_S5PRR_S2S with 1500s (5) cores
% 0.18/0.49 % Starting new_bool_3 with 300s (1) cores
% 0.18/0.49 % Starting new_bool_1 with 300s (1) cores
% 0.18/0.49 % Starting sh5l with 300s (1) cores
% 0.18/0.49 % new_bool_3 with pid 1427936 completed with status 0
% 0.18/0.49 % Result found by new_bool_3
% 0.18/0.49 % Preprocessing class: FSLSSMSSSSSNFFN.
% 0.18/0.49 % Scheduled 4 strats onto 8 cores with 300 seconds (2400 total)
% 0.18/0.49 % Starting G-E--_207_C18_F1_SE_CS_SP_PI_PS_S5PRR_S2S with 1500s (5) cores
% 0.18/0.49 % Starting new_bool_3 with 300s (1) cores
% 0.18/0.49 % (lift_lambdas = 0, lambda_to_forall = 0,unroll_only_formulas = 0, sine = GSinE(CountFormulas,hypos,1.5,,3,20000,1.0))
% 0.18/0.49 % SinE strategy is GSinE(CountFormulas,hypos,1.5,,3,20000,1.0)
% 0.18/0.49 % Search class: FGHSF-FFMM21-MFFFFFNN
% 0.18/0.49 % Scheduled 5 strats onto 1 cores with 300 seconds (300 total)
% 0.18/0.49 % Starting SubtermCWHack with 31s (1) cores
% 0.18/0.49 % SubtermCWHack with pid 1427943 completed with status 0
% 0.18/0.49 % Result found by SubtermCWHack
% 0.18/0.49 % Preprocessing class: FSLSSMSSSSSNFFN.
% 0.18/0.49 % Scheduled 4 strats onto 8 cores with 300 seconds (2400 total)
% 0.18/0.49 % Starting G-E--_207_C18_F1_SE_CS_SP_PI_PS_S5PRR_S2S with 1500s (5) cores
% 0.18/0.49 % Starting new_bool_3 with 300s (1) cores
% 0.18/0.49 % (lift_lambdas = 0, lambda_to_forall = 0,unroll_only_formulas = 0, sine = GSinE(CountFormulas,hypos,1.5,,3,20000,1.0))
% 0.18/0.49 % SinE strategy is GSinE(CountFormulas,hypos,1.5,,3,20000,1.0)
% 0.18/0.49 % Search class: FGHSF-FFMM21-MFFFFFNN
% 0.18/0.49 % Scheduled 5 strats onto 1 cores with 300 seconds (300 total)
% 0.18/0.49 % Starting SubtermCWHack with 31s (1) cores
% 0.18/0.49 % Preprocessing time : 0.002 s
% 0.18/0.49
% 0.18/0.49 % Proof found!
% 0.18/0.49 % SZS status Theorem
% 0.18/0.49 % SZS output start CNFRefutation
% See solution above
% 0.18/0.49 % Parsed axioms : 96
% 0.18/0.49 % Removed by relevancy pruning/SinE : 49
% 0.18/0.49 % Initial clauses : 84
% 0.18/0.49 % Removed in clause preprocessing : 1
% 0.18/0.49 % Initial clauses in saturation : 83
% 0.18/0.49 % Processed clauses : 474
% 0.18/0.49 % ...of these trivial : 34
% 0.18/0.49 % ...subsumed : 162
% 0.18/0.49 % ...remaining for further processing : 278
% 0.18/0.49 % Other redundant clauses eliminated : 37
% 0.18/0.49 % Clauses deleted for lack of memory : 0
% 0.18/0.49 % Backward-subsumed : 65
% 0.18/0.49 % Backward-rewritten : 6
% 0.18/0.49 % Generated clauses : 1772
% 0.18/0.49 % ...of the previous two non-redundant : 1396
% 0.18/0.49 % ...aggressively subsumed : 0
% 0.18/0.49 % Contextual simplify-reflections : 34
% 0.18/0.49 % Paramodulations : 1723
% 0.18/0.49 % Factorizations : 0
% 0.18/0.49 % NegExts : 0
% 0.18/0.49 % Equation resolutions : 42
% 0.18/0.49 % Disequality decompositions : 0
% 0.18/0.49 % Total rewrite steps : 1395
% 0.18/0.49 % ...of those cached : 1370
% 0.18/0.49 % Propositional unsat checks : 0
% 0.18/0.49 % Propositional check models : 0
% 0.18/0.49 % Propositional check unsatisfiable : 0
% 0.18/0.49 % Propositional clauses : 0
% 0.18/0.49 % Propositional clauses after purity: 0
% 0.18/0.49 % Propositional unsat core size : 0
% 0.18/0.49 % Propositional preprocessing time : 0.000
% 0.18/0.49 % Propositional encoding time : 0.000
% 0.18/0.49 % Propositional solver time : 0.000
% 0.18/0.49 % Success case prop preproc time : 0.000
% 0.18/0.49 % Success case prop encoding time : 0.000
% 0.18/0.49 % Success case prop solver time : 0.000
% 0.18/0.49 % Current number of processed clauses : 193
% 0.18/0.49 % Positive orientable unit clauses : 26
% 0.18/0.49 % Positive unorientable unit clauses: 0
% 0.18/0.49 % Negative unit clauses : 7
% 0.18/0.49 % Non-unit-clauses : 160
% 0.18/0.49 % Current number of unprocessed clauses: 953
% 0.18/0.49 % ...number of literals in the above : 5077
% 0.18/0.49 % Current number of archived formulas : 0
% 0.18/0.49 % Current number of archived clauses : 79
% 0.18/0.49 % Clause-clause subsumption calls (NU) : 3982
% 0.18/0.49 % Rec. Clause-clause subsumption calls : 1955
% 0.18/0.49 % Non-unit clause-clause subsumptions : 214
% 0.18/0.49 % Unit Clause-clause subsumption calls : 285
% 0.18/0.49 % Rewrite failures with RHS unbound : 0
% 0.18/0.49 % BW rewrite match attempts : 8
% 0.18/0.49 % BW rewrite match successes : 8
% 0.18/0.49 % Condensation attempts : 0
% 0.18/0.49 % Condensation successes : 0
% 0.18/0.49 % Termbank termtop insertions : 37036
% 0.18/0.49 % Search garbage collected termcells : 2196
% 0.18/0.49
% 0.18/0.49 % -------------------------------------------------
% 0.18/0.49 % User time : 0.051 s
% 0.18/0.49 % System time : 0.004 s
% 0.18/0.49 % Total time : 0.055 s
% 0.18/0.49 % Maximum resident set size: 3964 pages
% 0.18/0.49
% 0.18/0.49 % -------------------------------------------------
% 0.18/0.49 % User time : 0.054 s
% 0.18/0.49 % System time : 0.010 s
% 0.18/0.49 % Total time : 0.064 s
% 0.18/0.49 % Maximum resident set size: 4608 pages
% 0.18/0.49 % E exiting
%------------------------------------------------------------------------------