%------------------------------------------------------------------------------
% File : E---3.5.1
% Problem : SWC092+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 : n008.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:42:58 PM UTC 2026
% Result : Theorem 0.26s 0.58s
% Output : CNFRefutation 0.26s
% Verified :
% SZS Type : Refutation
% Derivation depth : 8
% Number of leaves : 6
% Syntax : Number of formulae : 38 ( 11 unt; 0 def)
% Number of atoms : 186 ( 46 equ)
% Maximal formula atoms : 23 ( 4 avg)
% Number of connectives : 232 ( 84 ~; 77 |; 43 &)
% ( 2 <=>; 26 =>; 0 <=; 0 <~>)
% Maximal formula depth : 29 ( 6 avg)
% Maximal term depth : 3 ( 1 avg)
% Number of predicates : 8 ( 6 usr; 1 prp; 0-2 aty)
% Number of functors : 8 ( 8 usr; 6 con; 0-2 aty)
% Number of variables : 72 ( 0 sgn 38 !; 15 ?)
% Comments :
%------------------------------------------------------------------------------
fof(co1,conjecture,
! [X1] :
( ssList(X1)
=> ! [X2] :
( ssList(X2)
=> ! [X3] :
( ssList(X3)
=> ! [X4] :
( ssList(X4)
=> ( ( nil = X3
& nil != X4 )
| ! [X6] :
( ssList(X6)
=> ( ? [X7] :
( ? [X8] :
( ? [X9] :
( ? [X10] :
( lt(X9,X7)
& app(X10,cons(X9,nil)) = X3
& ssList(X10) )
& ssItem(X9) )
& app(cons(X7,nil),X8) = X6
& ssList(X8) )
& ssItem(X7) )
| ~ strictorderedP(X3)
| app(X3,X6) != X4 ) )
| ? [X5] :
( segmentP(X1,X5)
& segmentP(X2,X5)
& neq(X5,nil)
& ssList(X5) )
| ~ neq(X2,nil)
| X1 != X3
| X2 != X4 ) ) ) ) ),
file('/export/starexec/sandbox2/benchmark/theBenchmark.p',co1) ).
fof(ax15,axiom,
! [X1] :
( ssList(X1)
=> ! [X2] :
( ssList(X2)
=> ( neq(X1,X2)
<=> X1 != X2 ) ) ),
file('/export/starexec/sandbox2/benchmark/Axioms/SWC001+0.ax',ax15) ).
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_6,negated_conjecture,
~ ! [X1] :
( ssList(X1)
=> ! [X2] :
( ssList(X2)
=> ! [X3] :
( ssList(X3)
=> ! [X4] :
( ssList(X4)
=> ( ( nil = X3
& nil != X4 )
| ! [X6] :
( ssList(X6)
=> ( ? [X7] :
( ? [X8] :
( ? [X9] :
( ? [X10] :
( lt(X9,X7)
& app(X10,cons(X9,nil)) = X3
& ssList(X10) )
& ssItem(X9) )
& app(cons(X7,nil),X8) = X6
& ssList(X8) )
& ssItem(X7) )
| ~ strictorderedP(X3)
| app(X3,X6) != X4 ) )
| ? [X5] :
( segmentP(X1,X5)
& segmentP(X2,X5)
& neq(X5,nil)
& ssList(X5) )
| ~ 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)
=> ( ( nil = X3
& nil != X4 )
| ! [X6] :
( ssList(X6)
=> ( ? [X7] :
( ? [X8] :
( ? [X9] :
( ? [X10] :
( lt(X9,X7)
& app(X10,cons(X9,nil)) = X3
& ssList(X10) )
& ssItem(X9) )
& app(cons(X7,nil),X8) = X6
& ssList(X8) )
& ssItem(X7) )
| ~ strictorderedP(X3)
| app(X3,X6) != X4 ) )
| ? [X5] :
( segmentP(X1,X5)
& segmentP(X2,X5)
& neq(X5,nil)
& ssList(X5) )
| ~ neq(X2,nil)
| X1 != X3
| X2 != X4 ) ) ) ) ),
inference(fof_simplification,[status(thm)],[c_0_6]) ).
fof(c_0_8,negated_conjecture,
! [X15,X17,X18,X19,X20] :
( ( nil != esk3_0
| nil = esk4_0 )
& ( ~ lt(X19,X17)
| app(X20,cons(X19,nil)) != esk3_0
| ~ ssList(X20)
| ~ ssItem(X19)
| app(cons(X17,nil),X18) != esk5_0
| ~ ssList(X18)
| ~ ssItem(X17) )
& strictorderedP(esk3_0)
& app(esk3_0,esk5_0) = esk4_0
& ssList(esk5_0)
& ( ~ segmentP(esk1_0,X15)
| ~ segmentP(esk2_0,X15)
| ~ neq(X15,nil)
| ~ ssList(X15) )
& 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(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_7])])])])]) ).
fof(c_0_9,plain,
! [X1] :
( ssList(X1)
=> ! [X2] :
( ssList(X2)
=> ( neq(X1,X2)
<=> X1 != X2 ) ) ),
inference(fof_simplification,[status(thm)],[ax15]) ).
fof(c_0_10,plain,
! [X95,X96,X97,X98] :
( segmentP(app(app(X97,X95),X98),X96)
| ~ segmentP(X95,X96)
| ~ ssList(X98)
| ~ ssList(X97)
| ~ ssList(X96)
| ~ ssList(X95) ),
inference(fof_nnf,[status(thm)],[inference(shift_quantors,[status(thm)],[inference(variable_rename,[status(thm)],[inference(fof_nnf,[status(thm)],[ax56])])])]) ).
fof(c_0_11,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_12,negated_conjecture,
( ~ segmentP(esk1_0,X1)
| ~ segmentP(esk2_0,X1)
| ~ neq(X1,nil)
| ~ ssList(X1) ),
inference(split_conjunct,[status(thm)],[c_0_8]) ).
cnf(c_0_13,negated_conjecture,
esk1_0 = esk3_0,
inference(split_conjunct,[status(thm)],[c_0_8]) ).
cnf(c_0_14,negated_conjecture,
esk2_0 = esk4_0,
inference(split_conjunct,[status(thm)],[c_0_8]) ).
fof(c_0_15,plain,
! [X103,X104] :
( ( ~ ssList(X103)
| ~ ssList(X104)
| neq(X103,X104)
| X103 = X104 )
& ( ~ ssList(X103)
| ~ ssList(X104)
| X103 != X104
| ~ neq(X103,X104) ) ),
inference(distribute,[status(thm)],[inference(fof_nnf,[status(thm)],[inference(shift_quantors,[status(thm)],[inference(variable_rename,[status(thm)],[inference(fof_nnf,[status(thm)],[c_0_9])])])])]) ).
cnf(c_0_16,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_17,plain,
( ~ ssList(X1)
| app(nil,X1) = X1 ),
inference(split_conjunct,[status(thm)],[c_0_11]) ).
cnf(c_0_18,plain,
ssList(nil),
inference(split_conjunct,[status(thm)],[ax17]) ).
cnf(c_0_19,negated_conjecture,
neq(esk2_0,nil),
inference(split_conjunct,[status(thm)],[c_0_8]) ).
cnf(c_0_20,negated_conjecture,
( ~ neq(X1,nil)
| ~ ssList(X1)
| ~ segmentP(esk4_0,X1)
| ~ segmentP(esk3_0,X1) ),
inference(rw,[status(thm)],[inference(rw,[status(thm)],[c_0_12,c_0_13]),c_0_14]) ).
cnf(c_0_21,plain,
( ~ ssList(X1)
| ~ ssList(X2)
| neq(X1,X2)
| X1 = X2 ),
inference(split_conjunct,[status(thm)],[c_0_15]) ).
cnf(c_0_22,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_16,c_0_17]),c_0_18])]) ).
cnf(c_0_23,negated_conjecture,
app(esk3_0,esk5_0) = esk4_0,
inference(split_conjunct,[status(thm)],[c_0_8]) ).
cnf(c_0_24,negated_conjecture,
ssList(esk5_0),
inference(split_conjunct,[status(thm)],[c_0_8]) ).
cnf(c_0_25,negated_conjecture,
ssList(esk3_0),
inference(split_conjunct,[status(thm)],[c_0_8]) ).
cnf(c_0_26,plain,
( ~ ssList(X1)
| ~ ssList(X2)
| X1 != X2
| ~ neq(X1,X2) ),
inference(split_conjunct,[status(thm)],[c_0_15]) ).
cnf(c_0_27,negated_conjecture,
neq(esk4_0,nil),
inference(rw,[status(thm)],[c_0_19,c_0_14]) ).
cnf(c_0_28,negated_conjecture,
( nil != esk3_0
| nil = esk4_0 ),
inference(split_conjunct,[status(thm)],[c_0_8]) ).
cnf(c_0_29,negated_conjecture,
( ~ ssList(X1)
| ~ segmentP(esk4_0,X1)
| ~ segmentP(esk3_0,X1)
| X1 = nil ),
inference(cn,[status(thm)],[inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_20,c_0_21]),c_0_18])]) ).
cnf(c_0_30,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_22,c_0_23]),c_0_24]),c_0_25])]) ).
fof(c_0_31,plain,
! [X94] :
( segmentP(X94,X94)
| ~ ssList(X94) ),
inference(fof_nnf,[status(thm)],[inference(variable_rename,[status(thm)],[inference(fof_nnf,[status(thm)],[ax55])])]) ).
cnf(c_0_32,plain,
( ~ neq(X1,X1)
| ~ ssList(X1) ),
inference(er,[status(thm)],[c_0_26]) ).
cnf(c_0_33,negated_conjecture,
( esk3_0 != nil
| neq(nil,nil) ),
inference(spm,[status(thm)],[c_0_27,c_0_28]) ).
cnf(c_0_34,negated_conjecture,
( ~ ssList(X1)
| ~ segmentP(esk3_0,X1)
| X1 = nil ),
inference(spm,[status(thm)],[c_0_29,c_0_30]) ).
cnf(c_0_35,plain,
( ~ ssList(X1)
| segmentP(X1,X1) ),
inference(split_conjunct,[status(thm)],[c_0_31]) ).
cnf(c_0_36,negated_conjecture,
esk3_0 != nil,
inference(cn,[status(thm)],[inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_32,c_0_33]),c_0_18])]) ).
cnf(c_0_37,negated_conjecture,
$false,
inference(sr,[status(thm)],[inference(cn,[status(thm)],[inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_34,c_0_35]),c_0_25])]),c_0_36]),
[proof] ).
%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.00/0.04 % Problem : SWC092+1 : TPTP v9.3.1. Released v2.4.0.
% 0.00/0.07 % Command : run_E /export/starexec/sandbox2/benchmark/theBenchmark.p 300 THM
% 0.17/0.43 % Computer : n008.cluster.edu
% 0.17/0.43 % Model : x86_64 x86_64
% 0.17/0.43 % CPU : Intel(R) Xeon(R) CPU E5-2620 v4 @ 2.10GHz
% 0.17/0.43 % Memory : 8046.5625MB
% 0.17/0.43 % OS : Linux 6.8.0-71-generic
% 0.17/0.43 % CPULimit : 300
% 0.17/0.43 % WCLimit : 300
% 0.17/0.43 % DateTime : Mon Sep 21 07:55:53 UTC 2026
% 0.17/0.44 % CPUTime :
% 0.17/0.44 Running run_E /export/starexec/sandbox2/benchmark/theBenchmark.p 300 THM
% 0.17/0.49 Running first-order theorem proving
% 0.17/0.49 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.26/0.58 % Version: 3.5.1
% 0.26/0.58 % Preprocessing class: FSLSSMSSSSSNFFN.
% 0.26/0.58 % Scheduled 4 strats onto 8 cores with 300 seconds (2400 total)
% 0.26/0.58 % Starting G-E--_207_C18_F1_SE_CS_SP_PI_PS_S5PRR_S2S with 1500s (5) cores
% 0.26/0.58 % Starting new_bool_3 with 300s (1) cores
% 0.26/0.58 % Starting new_bool_1 with 300s (1) cores
% 0.26/0.58 % Starting sh5l with 300s (1) cores
% 0.26/0.58 % new_bool_3 with pid 527553 completed with status 0
% 0.26/0.58 % Result found by new_bool_3
% 0.26/0.58 % Preprocessing class: FSLSSMSSSSSNFFN.
% 0.26/0.58 % Scheduled 4 strats onto 8 cores with 300 seconds (2400 total)
% 0.26/0.58 % Starting G-E--_207_C18_F1_SE_CS_SP_PI_PS_S5PRR_S2S with 1500s (5) cores
% 0.26/0.58 % Starting new_bool_3 with 300s (1) cores
% 0.26/0.58 % (lift_lambdas = 0, lambda_to_forall = 0,unroll_only_formulas = 0, sine = GSinE(CountFormulas,hypos,1.5,,3,20000,1.0))
% 0.26/0.58 % SinE strategy is GSinE(CountFormulas,hypos,1.5,,3,20000,1.0)
% 0.26/0.58 % Search class: FGHSF-FFMM21-MFFFFFNN
% 0.26/0.58 % Scheduled 5 strats onto 1 cores with 300 seconds (300 total)
% 0.26/0.58 % Starting SubtermCWHack with 31s (1) cores
% 0.26/0.58 % SubtermCWHack with pid 527556 completed with status 0
% 0.26/0.58 % Result found by SubtermCWHack
% 0.26/0.58 % Preprocessing class: FSLSSMSSSSSNFFN.
% 0.26/0.58 % Scheduled 4 strats onto 8 cores with 300 seconds (2400 total)
% 0.26/0.58 % Starting G-E--_207_C18_F1_SE_CS_SP_PI_PS_S5PRR_S2S with 1500s (5) cores
% 0.26/0.58 % Starting new_bool_3 with 300s (1) cores
% 0.26/0.58 % (lift_lambdas = 0, lambda_to_forall = 0,unroll_only_formulas = 0, sine = GSinE(CountFormulas,hypos,1.5,,3,20000,1.0))
% 0.26/0.58 % SinE strategy is GSinE(CountFormulas,hypos,1.5,,3,20000,1.0)
% 0.26/0.58 % Search class: FGHSF-FFMM21-MFFFFFNN
% 0.26/0.58 % Scheduled 5 strats onto 1 cores with 300 seconds (300 total)
% 0.26/0.58 % Starting SubtermCWHack with 31s (1) cores
% 0.26/0.58 % Preprocessing time : 0.003 s
% 0.26/0.58
% 0.26/0.58 % Proof found!
% 0.26/0.58 % SZS status Theorem
% 0.26/0.58 % SZS output start CNFRefutation
% See solution above
% 0.26/0.58 % Parsed axioms : 96
% 0.26/0.58 % Removed by relevancy pruning/SinE : 47
% 0.26/0.58 % Initial clauses : 89
% 0.26/0.58 % Removed in clause preprocessing : 1
% 0.26/0.58 % Initial clauses in saturation : 88
% 0.26/0.58 % Processed clauses : 323
% 0.26/0.58 % ...of these trivial : 16
% 0.26/0.58 % ...subsumed : 104
% 0.26/0.58 % ...remaining for further processing : 203
% 0.26/0.58 % Other redundant clauses eliminated : 28
% 0.26/0.58 % Clauses deleted for lack of memory : 0
% 0.26/0.58 % Backward-subsumed : 18
% 0.26/0.58 % Backward-rewritten : 3
% 0.26/0.58 % Generated clauses : 879
% 0.26/0.58 % ...of the previous two non-redundant : 714
% 0.26/0.58 % ...aggressively subsumed : 0
% 0.26/0.58 % Contextual simplify-reflections : 11
% 0.26/0.58 % Paramodulations : 847
% 0.26/0.58 % Factorizations : 0
% 0.26/0.58 % NegExts : 0
% 0.26/0.58 % Equation resolutions : 33
% 0.26/0.58 % Disequality decompositions : 0
% 0.26/0.58 % Total rewrite steps : 689
% 0.26/0.58 % ...of those cached : 672
% 0.26/0.58 % Propositional unsat checks : 0
% 0.26/0.58 % Propositional check models : 0
% 0.26/0.58 % Propositional check unsatisfiable : 0
% 0.26/0.58 % Propositional clauses : 0
% 0.26/0.58 % Propositional clauses after purity: 0
% 0.26/0.58 % Propositional unsat core size : 0
% 0.26/0.58 % Propositional preprocessing time : 0.000
% 0.26/0.58 % Propositional encoding time : 0.000
% 0.26/0.58 % Propositional solver time : 0.000
% 0.26/0.58 % Success case prop preproc time : 0.000
% 0.26/0.58 % Success case prop encoding time : 0.000
% 0.26/0.58 % Success case prop solver time : 0.000
% 0.26/0.58 % Current number of processed clauses : 174
% 0.26/0.58 % Positive orientable unit clauses : 23
% 0.26/0.58 % Positive unorientable unit clauses: 0
% 0.26/0.58 % Negative unit clauses : 10
% 0.26/0.58 % Non-unit-clauses : 141
% 0.26/0.58 % Current number of unprocessed clauses: 472
% 0.26/0.58 % ...number of literals in the above : 2500
% 0.26/0.58 % Current number of archived formulas : 0
% 0.26/0.58 % Current number of archived clauses : 21
% 0.26/0.58 % Clause-clause subsumption calls (NU) : 2213
% 0.26/0.58 % Rec. Clause-clause subsumption calls : 995
% 0.26/0.58 % Non-unit clause-clause subsumptions : 97
% 0.26/0.58 % Unit Clause-clause subsumption calls : 142
% 0.26/0.58 % Rewrite failures with RHS unbound : 0
% 0.26/0.58 % BW rewrite match attempts : 3
% 0.26/0.58 % BW rewrite match successes : 3
% 0.26/0.58 % Condensation attempts : 0
% 0.26/0.58 % Condensation successes : 0
% 0.26/0.58 % Termbank termtop insertions : 23014
% 0.26/0.58 % Search garbage collected termcells : 2294
% 0.26/0.58
% 0.26/0.58 % -------------------------------------------------
% 0.26/0.58 % User time : 0.051 s
% 0.26/0.58 % System time : 0.006 s
% 0.26/0.58 % Total time : 0.057 s
% 0.26/0.58 % Maximum resident set size: 4020 pages
% 0.26/0.58
% 0.26/0.58 % -------------------------------------------------
% 0.26/0.58 % User time : 0.057 s
% 0.26/0.58 % System time : 0.012 s
% 0.26/0.58 % Total time : 0.070 s
% 0.26/0.58 % Maximum resident set size: 4864 pages
% 0.26/0.58 % E exiting
%------------------------------------------------------------------------------