%------------------------------------------------------------------------------
% File : E---3.5.1
% Problem : SWC068-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:42:51 PM UTC 2026
% Result : Unsatisfiable 0.26s 0.62s
% Output : CNFRefutation 0.26s
% Verified :
% SZS Type : Refutation
% Derivation depth : 7
% Number of leaves : 15
% Syntax : Number of clauses : 55 ( 19 unt; 3 nHn; 55 RR)
% Number of literals : 144 ( 47 equ; 95 neg)
% Maximal clause size : 6 ( 2 avg)
% Maximal term depth : 3 ( 1 avg)
% Number of predicates : 5 ( 3 usr; 1 prp; 0-2 aty)
% Number of functors : 6 ( 6 usr; 5 con; 0-2 aty)
% Number of variables : 58 ( 0 sgn)
% Comments :
%------------------------------------------------------------------------------
cnf(co1_8,negated_conjecture,
( ~ segmentP(sk1,X1)
| ~ segmentP(sk2,X1)
| ~ neq(X1,nil)
| ~ ssList(X1) ),
file('/export/starexec/sandbox2/benchmark/theBenchmark.p',co1_8) ).
cnf(clause172,axiom,
( ~ ssList(X1)
| ~ ssList(X2)
| ~ ssList(X4)
| ~ ssList(X3)
| ~ segmentP(X1,X2)
| segmentP(app(app(X4,X1),X3),X2) ),
file('/export/starexec/sandbox2/benchmark/Axioms/SWC001-0.ax',clause172) ).
cnf(co1_5,negated_conjecture,
app(sk4,sk4) = sk3,
file('/export/starexec/sandbox2/benchmark/theBenchmark.p',co1_5) ).
cnf(co1_7,negated_conjecture,
sk1 = sk3,
file('/export/starexec/sandbox2/benchmark/theBenchmark.p',co1_7) ).
cnf(clause149,axiom,
( ~ ssList(X3)
| ~ ssList(X2)
| ~ ssList(X1)
| app(app(X3,X2),X1) = app(X3,app(X2,X1)) ),
file('/export/starexec/sandbox2/benchmark/Axioms/SWC001-0.ax',clause149) ).
cnf(co1_6,negated_conjecture,
sk2 = sk4,
file('/export/starexec/sandbox2/benchmark/theBenchmark.p',co1_6) ).
cnf(clause100,axiom,
( ~ ssList(X2)
| ~ ssList(X1)
| X2 = X1
| neq(X2,X1) ),
file('/export/starexec/sandbox2/benchmark/Axioms/SWC001-0.ax',clause100) ).
cnf(co1_4,negated_conjecture,
ssList(sk4),
file('/export/starexec/sandbox2/benchmark/theBenchmark.p',co1_4) ).
cnf(clause73,axiom,
( ~ ssList(X1)
| app(X1,nil) = X1 ),
file('/export/starexec/sandbox2/benchmark/Axioms/SWC001-0.ax',clause73) ).
cnf(clause150,axiom,
( ~ ssList(X3)
| ~ ssList(X1)
| ~ ssList(X2)
| app(X1,X2) != app(X1,X3)
| X2 = X3 ),
file('/export/starexec/sandbox2/benchmark/Axioms/SWC001-0.ax',clause150) ).
cnf(clause8,axiom,
ssList(nil),
file('/export/starexec/sandbox2/benchmark/Axioms/SWC001-0.ax',clause8) ).
cnf(clause57,axiom,
( ~ ssList(X1)
| segmentP(X1,X1) ),
file('/export/starexec/sandbox2/benchmark/Axioms/SWC001-0.ax',clause57) ).
cnf(co1_1,negated_conjecture,
ssList(sk1),
file('/export/starexec/sandbox2/benchmark/theBenchmark.p',co1_1) ).
cnf(co1_9,negated_conjecture,
( nil != sk1
| nil != sk2 ),
file('/export/starexec/sandbox2/benchmark/theBenchmark.p',co1_9) ).
cnf(clause119,axiom,
( ~ ssList(X1)
| ~ ssList(X2)
| app(X1,X2) != nil
| nil = X2 ),
file('/export/starexec/sandbox2/benchmark/Axioms/SWC001-0.ax',clause119) ).
cnf(c_0_15,negated_conjecture,
( ~ segmentP(sk1,X1)
| ~ segmentP(sk2,X1)
| ~ neq(X1,nil)
| ~ ssList(X1) ),
inference(fof_simplification,[status(thm)],[co1_8]) ).
cnf(c_0_16,plain,
( ~ ssList(X1)
| ~ ssList(X2)
| ~ ssList(X4)
| ~ ssList(X3)
| ~ segmentP(X1,X2)
| segmentP(app(app(X4,X1),X3),X2) ),
inference(fof_simplification,[status(thm)],[clause172]) ).
cnf(c_0_17,negated_conjecture,
app(sk4,sk4) = sk3,
co1_5 ).
cnf(c_0_18,negated_conjecture,
sk1 = sk3,
co1_7 ).
cnf(c_0_19,plain,
( ~ ssList(X3)
| ~ ssList(X2)
| ~ ssList(X1)
| app(app(X3,X2),X1) = app(X3,app(X2,X1)) ),
inference(fof_simplification,[status(thm)],[clause149]) ).
cnf(c_0_20,negated_conjecture,
( ~ segmentP(sk1,X1)
| ~ segmentP(sk2,X1)
| ~ neq(X1,nil)
| ~ ssList(X1) ),
c_0_15 ).
cnf(c_0_21,negated_conjecture,
sk2 = sk4,
co1_6 ).
cnf(c_0_22,plain,
( ~ ssList(X2)
| ~ ssList(X1)
| X2 = X1
| neq(X2,X1) ),
inference(fof_simplification,[status(thm)],[clause100]) ).
cnf(c_0_23,plain,
( ~ ssList(X1)
| ~ ssList(X2)
| ~ ssList(X4)
| ~ ssList(X3)
| ~ segmentP(X1,X2)
| segmentP(app(app(X4,X1),X3),X2) ),
c_0_16 ).
cnf(c_0_24,negated_conjecture,
app(sk4,sk4) = sk1,
inference(rw,[status(thm)],[c_0_17,c_0_18]) ).
cnf(c_0_25,negated_conjecture,
ssList(sk4),
co1_4 ).
cnf(c_0_26,plain,
( ~ ssList(X1)
| app(X1,nil) = X1 ),
inference(fof_simplification,[status(thm)],[clause73]) ).
cnf(c_0_27,plain,
( ~ ssList(X3)
| ~ ssList(X1)
| ~ ssList(X2)
| app(X1,X2) != app(X1,X3)
| X2 = X3 ),
inference(fof_simplification,[status(thm)],[clause150]) ).
cnf(c_0_28,plain,
( ~ ssList(X3)
| ~ ssList(X2)
| ~ ssList(X1)
| app(app(X3,X2),X1) = app(X3,app(X2,X1)) ),
c_0_19 ).
cnf(c_0_29,negated_conjecture,
( ~ ssList(X1)
| ~ segmentP(sk4,X1)
| ~ segmentP(sk1,X1)
| ~ neq(X1,nil) ),
inference(rw,[status(thm)],[c_0_20,c_0_21]) ).
cnf(c_0_30,plain,
( ~ ssList(X2)
| ~ ssList(X1)
| X2 = X1
| neq(X2,X1) ),
c_0_22 ).
cnf(c_0_31,axiom,
ssList(nil),
clause8 ).
cnf(c_0_32,plain,
( ~ ssList(X1)
| segmentP(X1,X1) ),
inference(fof_simplification,[status(thm)],[clause57]) ).
cnf(c_0_33,negated_conjecture,
( ~ ssList(X2)
| ~ ssList(X1)
| ~ segmentP(sk4,X2)
| segmentP(app(sk1,X1),X2) ),
inference(cn,[status(thm)],[inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_23,c_0_24]),c_0_25])]) ).
cnf(c_0_34,plain,
( ~ ssList(X1)
| app(X1,nil) = X1 ),
c_0_26 ).
cnf(c_0_35,negated_conjecture,
ssList(sk1),
co1_1 ).
cnf(c_0_36,negated_conjecture,
( nil != sk1
| nil != sk2 ),
inference(fof_simplification,[status(thm)],[co1_9]) ).
cnf(c_0_37,plain,
( ~ ssList(X3)
| ~ ssList(X1)
| ~ ssList(X2)
| app(X1,X2) != app(X1,X3)
| X2 = X3 ),
c_0_27 ).
cnf(c_0_38,negated_conjecture,
( ~ ssList(X1)
| app(sk4,app(sk4,X1)) = app(sk1,X1) ),
inference(cn,[status(thm)],[inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_28,c_0_24]),c_0_25])]) ).
cnf(c_0_39,negated_conjecture,
( ~ ssList(X1)
| ~ segmentP(sk4,X1)
| ~ segmentP(sk1,X1)
| nil = X1 ),
inference(cn,[status(thm)],[inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_29,c_0_30]),c_0_31])]) ).
cnf(c_0_40,plain,
( ~ ssList(X1)
| segmentP(X1,X1) ),
c_0_32 ).
cnf(c_0_41,negated_conjecture,
( ~ ssList(X1)
| ~ segmentP(sk4,X1)
| segmentP(sk1,X1) ),
inference(cn,[status(thm)],[inference(rw,[status(thm)],[inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_33,c_0_34]),c_0_31]),c_0_35])]) ).
cnf(c_0_42,plain,
( ~ ssList(X1)
| ~ ssList(X2)
| app(X1,X2) != nil
| nil = X2 ),
inference(fof_simplification,[status(thm)],[clause119]) ).
cnf(c_0_43,negated_conjecture,
( nil != sk1
| nil != sk2 ),
c_0_36 ).
cnf(c_0_44,negated_conjecture,
( ~ ssList(X1)
| app(sk4,X1) != sk1
| X1 = sk4 ),
inference(cn,[status(thm)],[inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_37,c_0_24]),c_0_25])]) ).
cnf(c_0_45,negated_conjecture,
app(sk4,sk1) = app(sk1,sk4),
inference(cn,[status(thm)],[inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_38,c_0_24]),c_0_25])]) ).
cnf(c_0_46,negated_conjecture,
( ~ segmentP(sk1,sk4)
| sk4 = nil ),
inference(cn,[status(thm)],[inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_39,c_0_40]),c_0_25])]) ).
cnf(c_0_47,negated_conjecture,
segmentP(sk1,sk4),
inference(cn,[status(thm)],[inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_41,c_0_40]),c_0_25])]) ).
cnf(c_0_48,plain,
( ~ ssList(X1)
| ~ ssList(X2)
| app(X1,X2) != nil
| nil = X2 ),
c_0_42 ).
cnf(c_0_49,negated_conjecture,
( sk4 != nil
| sk1 != nil ),
inference(rw,[status(thm)],[c_0_43,c_0_21]) ).
cnf(c_0_50,negated_conjecture,
( app(sk1,sk4) != sk1
| sk4 = sk1 ),
inference(cn,[status(thm)],[inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_44,c_0_45]),c_0_35])]) ).
cnf(c_0_51,negated_conjecture,
sk4 = nil,
inference(cn,[status(thm)],[inference(rw,[status(thm)],[c_0_46,c_0_47])]) ).
cnf(c_0_52,negated_conjecture,
app(sk1,nil) = sk1,
inference(cn,[status(thm)],[inference(rw,[status(thm)],[inference(rw,[status(thm)],[inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_38,c_0_34]),c_0_24]),c_0_31]),c_0_25])]) ).
cnf(c_0_53,negated_conjecture,
sk1 != nil,
inference(csr,[status(thm)],[inference(cn,[status(thm)],[inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_48,c_0_24]),c_0_25])]),c_0_49]) ).
cnf(c_0_54,negated_conjecture,
$false,
inference(sr,[status(thm)],[inference(cn,[status(thm)],[inference(rw,[status(thm)],[inference(rw,[status(thm)],[inference(rw,[status(thm)],[c_0_50,c_0_51]),c_0_51]),c_0_52])]),c_0_53]),
[proof] ).
%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.00/0.03 % Problem : SWC068-1 : TPTP v9.3.1. Released v2.4.0.
% 0.00/0.06 % Command : run_E /export/starexec/sandbox2/benchmark/theBenchmark.p 300 THM
% 0.20/0.45 % Computer : n018.cluster.edu
% 0.20/0.45 % Model : x86_64 x86_64
% 0.20/0.45 % CPU : Intel(R) Xeon(R) CPU E5-2620 v4 @ 2.10GHz
% 0.20/0.45 % Memory : 8046.5625MB
% 0.20/0.45 % OS : Linux 6.8.0-71-generic
% 0.20/0.45 % CPULimit : 300
% 0.20/0.45 % WCLimit : 300
% 0.20/0.45 % DateTime : Mon Sep 21 07:54:58 UTC 2026
% 0.20/0.45 % CPUTime :
% 0.20/0.45 Running run_E /export/starexec/sandbox2/benchmark/theBenchmark.p 300 THM
% 0.26/0.53 Running first-order theorem proving
% 0.26/0.53 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.62 % Version: 3.5.1
% 0.26/0.62 % Preprocessing class: FSLSSMSSSSSNFFN.
% 0.26/0.62 % Scheduled 4 strats onto 8 cores with 300 seconds (2400 total)
% 0.26/0.62 % Starting G-E--_207_C18_F1_SE_CS_SP_PI_PS_S5PRR_S2S with 1500s (5) cores
% 0.26/0.62 % Starting new_bool_3 with 300s (1) cores
% 0.26/0.62 % Starting new_bool_1 with 300s (1) cores
% 0.26/0.62 % Starting sh5l with 300s (1) cores
% 0.26/0.62 % new_bool_1 with pid 1385729 completed with status 0
% 0.26/0.62 % Result found by new_bool_1
% 0.26/0.62 % Preprocessing class: FSLSSMSSSSSNFFN.
% 0.26/0.62 % Scheduled 4 strats onto 8 cores with 300 seconds (2400 total)
% 0.26/0.62 % Starting G-E--_207_C18_F1_SE_CS_SP_PI_PS_S5PRR_S2S with 1500s (5) cores
% 0.26/0.62 % Starting new_bool_3 with 300s (1) cores
% 0.26/0.62 % Starting new_bool_1 with 300s (1) cores
% 0.26/0.62 % (lift_lambdas = 0, lambda_to_forall = 0,unroll_only_formulas = 0, sine = GSinE(CountFormulas,hypos,1.5,,3,20000,1.0))
% 0.26/0.62 % SinE strategy is GSinE(CountFormulas,hypos,1.5,,3,20000,1.0)
% 0.26/0.62 % Search class: FGHSF-FFMM22-SFFFFFNN
% 0.26/0.62 % Scheduled 5 strats onto 1 cores with 300 seconds (300 total)
% 0.26/0.62 % Starting SubtermCWHack with 31s (1) cores
% 0.26/0.62 % SubtermCWHack with pid 1385737 completed with status 0
% 0.26/0.62 % Result found by SubtermCWHack
% 0.26/0.62 % Preprocessing class: FSLSSMSSSSSNFFN.
% 0.26/0.62 % Scheduled 4 strats onto 8 cores with 300 seconds (2400 total)
% 0.26/0.62 % Starting G-E--_207_C18_F1_SE_CS_SP_PI_PS_S5PRR_S2S with 1500s (5) cores
% 0.26/0.62 % Starting new_bool_3 with 300s (1) cores
% 0.26/0.62 % Starting new_bool_1 with 300s (1) cores
% 0.26/0.62 % (lift_lambdas = 0, lambda_to_forall = 0,unroll_only_formulas = 0, sine = GSinE(CountFormulas,hypos,1.5,,3,20000,1.0))
% 0.26/0.62 % SinE strategy is GSinE(CountFormulas,hypos,1.5,,3,20000,1.0)
% 0.26/0.62 % Search class: FGHSF-FFMM22-SFFFFFNN
% 0.26/0.62 % Scheduled 5 strats onto 1 cores with 300 seconds (300 total)
% 0.26/0.62 % Starting SubtermCWHack with 31s (1) cores
% 0.26/0.62 % Preprocessing time : 0.003 s
% 0.26/0.62
% 0.26/0.62 % Proof found!
% 0.26/0.62 % SZS status Unsatisfiable
% 0.26/0.62 % SZS output start CNFRefutation
% See solution above
% 0.26/0.62 % Parsed axioms : 194
% 0.26/0.62 % Removed by relevancy pruning/SinE : 156
% 0.26/0.62 % Initial clauses : 38
% 0.26/0.62 % Removed in clause preprocessing : 0
% 0.26/0.62 % Initial clauses in saturation : 38
% 0.26/0.62 % Processed clauses : 136
% 0.26/0.62 % ...of these trivial : 0
% 0.26/0.62 % ...subsumed : 39
% 0.26/0.62 % ...remaining for further processing : 97
% 0.26/0.62 % Other redundant clauses eliminated : 10
% 0.26/0.62 % Clauses deleted for lack of memory : 0
% 0.26/0.62 % Backward-subsumed : 5
% 0.26/0.62 % Backward-rewritten : 30
% 0.26/0.62 % Generated clauses : 302
% 0.26/0.62 % ...of the previous two non-redundant : 249
% 0.26/0.62 % ...aggressively subsumed : 0
% 0.26/0.62 % Contextual simplify-reflections : 1
% 0.26/0.62 % Paramodulations : 289
% 0.26/0.62 % Factorizations : 0
% 0.26/0.62 % NegExts : 0
% 0.26/0.62 % Equation resolutions : 14
% 0.26/0.62 % Disequality decompositions : 0
% 0.26/0.62 % Total rewrite steps : 331
% 0.26/0.62 % ...of those cached : 317
% 0.26/0.62 % Propositional unsat checks : 0
% 0.26/0.62 % Propositional check models : 0
% 0.26/0.62 % Propositional check unsatisfiable : 0
% 0.26/0.62 % Propositional clauses : 0
% 0.26/0.62 % Propositional clauses after purity: 0
% 0.26/0.62 % Propositional unsat core size : 0
% 0.26/0.62 % Propositional preprocessing time : 0.000
% 0.26/0.62 % Propositional encoding time : 0.000
% 0.26/0.62 % Propositional solver time : 0.000
% 0.26/0.62 % Success case prop preproc time : 0.000
% 0.26/0.62 % Success case prop encoding time : 0.000
% 0.26/0.62 % Success case prop solver time : 0.000
% 0.26/0.62 % Current number of processed clauses : 57
% 0.26/0.62 % Positive orientable unit clauses : 11
% 0.26/0.62 % Positive unorientable unit clauses: 0
% 0.26/0.62 % Negative unit clauses : 6
% 0.26/0.62 % Non-unit-clauses : 40
% 0.26/0.62 % Current number of unprocessed clauses: 144
% 0.26/0.62 % ...number of literals in the above : 682
% 0.26/0.62 % Current number of archived formulas : 0
% 0.26/0.62 % Current number of archived clauses : 35
% 0.26/0.62 % Clause-clause subsumption calls (NU) : 416
% 0.26/0.62 % Rec. Clause-clause subsumption calls : 232
% 0.26/0.62 % Non-unit clause-clause subsumptions : 35
% 0.26/0.62 % Unit Clause-clause subsumption calls : 38
% 0.26/0.62 % Rewrite failures with RHS unbound : 0
% 0.26/0.62 % BW rewrite match attempts : 4
% 0.26/0.62 % BW rewrite match successes : 4
% 0.26/0.62 % Condensation attempts : 0
% 0.26/0.62 % Condensation successes : 0
% 0.26/0.62 % Termbank termtop insertions : 8063
% 0.26/0.62 % Search garbage collected termcells : 916
% 0.26/0.62
% 0.26/0.62 % -------------------------------------------------
% 0.26/0.62 % User time : 0.018 s
% 0.26/0.62 % System time : 0.006 s
% 0.26/0.62 % Total time : 0.023 s
% 0.26/0.62 % Maximum resident set size: 3808 pages
% 0.26/0.62
% 0.26/0.62 % -------------------------------------------------
% 0.26/0.62 % User time : 0.023 s
% 0.26/0.62 % System time : 0.014 s
% 0.26/0.62 % Total time : 0.037 s
% 0.26/0.62 % Maximum resident set size: 5120 pages
% 0.26/0.62 % E exiting
%------------------------------------------------------------------------------