%------------------------------------------------------------------------------
% File : E---3.5.1
% Problem : SWC054-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 : n020.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:47 PM UTC 2026
% Result : Unsatisfiable 0.16s 0.66s
% Output : CNFRefutation 0.16s
% Verified :
% SZS Type : Refutation
% Derivation depth : 7
% Number of leaves : 15
% Syntax : Number of clauses : 55 ( 11 unt; 6 nHn; 55 RR)
% Number of literals : 128 ( 37 equ; 74 neg)
% Maximal clause size : 5 ( 2 avg)
% Maximal term depth : 1 ( 1 avg)
% Number of predicates : 5 ( 3 usr; 1 prp; 0-2 aty)
% Number of functors : 6 ( 6 usr; 6 con; 0-0 aty)
% Number of variables : 14 ( 0 sgn)
% Comments :
%------------------------------------------------------------------------------
cnf(co1_15,negated_conjecture,
( ~ segmentP(sk1,X1)
| ~ segmentP(sk2,X1)
| ~ neq(X1,nil)
| ~ ssList(X1)
| nil != sk1 ),
file('/export/starexec/sandbox/benchmark/theBenchmark.p',co1_15) ).
cnf(co1_14,negated_conjecture,
( nil != sk1
| neq(sk2,nil) ),
file('/export/starexec/sandbox/benchmark/theBenchmark.p',co1_14) ).
cnf(co1_5,negated_conjecture,
sk2 = sk4,
file('/export/starexec/sandbox/benchmark/theBenchmark.p',co1_5) ).
cnf(co1_7,negated_conjecture,
( nil != sk4
| nil = sk3 ),
file('/export/starexec/sandbox/benchmark/theBenchmark.p',co1_7) ).
cnf(co1_11,negated_conjecture,
( ~ neq(sk4,nil)
| segmentP(sk3,sk5) ),
file('/export/starexec/sandbox/benchmark/theBenchmark.p',co1_11) ).
cnf(co1_4,negated_conjecture,
ssList(sk4),
file('/export/starexec/sandbox/benchmark/theBenchmark.p',co1_4) ).
cnf(co1_6,negated_conjecture,
sk1 = sk3,
file('/export/starexec/sandbox/benchmark/theBenchmark.p',co1_6) ).
cnf(co1_13,negated_conjecture,
( ~ segmentP(sk1,X1)
| ~ segmentP(sk2,X1)
| ~ neq(X1,nil)
| ~ ssList(X1)
| nil = sk2 ),
file('/export/starexec/sandbox/benchmark/theBenchmark.p',co1_13) ).
cnf(co1_8,negated_conjecture,
( ~ neq(sk4,nil)
| ssList(sk5) ),
file('/export/starexec/sandbox/benchmark/theBenchmark.p',co1_8) ).
cnf(co1_12,negated_conjecture,
( neq(sk2,nil)
| nil = sk2 ),
file('/export/starexec/sandbox/benchmark/theBenchmark.p',co1_12) ).
cnf(co1_10,negated_conjecture,
( ~ neq(sk4,nil)
| segmentP(sk4,sk5) ),
file('/export/starexec/sandbox/benchmark/theBenchmark.p',co1_10) ).
cnf(clause57,axiom,
( ~ ssList(X1)
| segmentP(X1,X1) ),
file('/export/starexec/sandbox/benchmark/Axioms/SWC001-0.ax',clause57) ).
cnf(co1_9,negated_conjecture,
( ~ neq(sk4,nil)
| neq(sk5,nil) ),
file('/export/starexec/sandbox/benchmark/theBenchmark.p',co1_9) ).
cnf(clause79,axiom,
( ~ ssList(X1)
| nil != X1
| segmentP(nil,X1) ),
file('/export/starexec/sandbox/benchmark/Axioms/SWC001-0.ax',clause79) ).
cnf(clause8,axiom,
ssList(nil),
file('/export/starexec/sandbox/benchmark/Axioms/SWC001-0.ax',clause8) ).
cnf(c_0_15,negated_conjecture,
( ~ segmentP(sk1,X1)
| ~ segmentP(sk2,X1)
| ~ neq(X1,nil)
| ~ ssList(X1)
| nil != sk1 ),
inference(fof_simplification,[status(thm)],[co1_15]) ).
cnf(c_0_16,negated_conjecture,
( nil != sk1
| neq(sk2,nil) ),
inference(fof_simplification,[status(thm)],[co1_14]) ).
cnf(c_0_17,negated_conjecture,
( ~ segmentP(sk1,X1)
| ~ segmentP(sk2,X1)
| ~ neq(X1,nil)
| ~ ssList(X1)
| nil != sk1 ),
c_0_15 ).
cnf(c_0_18,negated_conjecture,
sk2 = sk4,
co1_5 ).
cnf(c_0_19,negated_conjecture,
( nil != sk1
| neq(sk2,nil) ),
c_0_16 ).
cnf(c_0_20,negated_conjecture,
( nil != sk4
| nil = sk3 ),
inference(fof_simplification,[status(thm)],[co1_7]) ).
cnf(c_0_21,negated_conjecture,
( ~ neq(sk4,nil)
| segmentP(sk3,sk5) ),
inference(fof_simplification,[status(thm)],[co1_11]) ).
cnf(c_0_22,negated_conjecture,
( ~ ssList(X1)
| ~ segmentP(sk4,X1)
| ~ segmentP(sk1,X1)
| ~ neq(X1,nil)
| sk1 != nil ),
inference(rw,[status(thm)],[c_0_17,c_0_18]) ).
cnf(c_0_23,negated_conjecture,
( sk1 != nil
| neq(sk4,nil) ),
inference(rw,[status(thm)],[c_0_19,c_0_18]) ).
cnf(c_0_24,negated_conjecture,
ssList(sk4),
co1_4 ).
cnf(c_0_25,negated_conjecture,
( nil != sk4
| nil = sk3 ),
c_0_20 ).
cnf(c_0_26,negated_conjecture,
sk1 = sk3,
co1_6 ).
cnf(c_0_27,negated_conjecture,
( ~ segmentP(sk1,X1)
| ~ segmentP(sk2,X1)
| ~ neq(X1,nil)
| ~ ssList(X1)
| nil = sk2 ),
inference(fof_simplification,[status(thm)],[co1_13]) ).
cnf(c_0_28,negated_conjecture,
( ~ neq(sk4,nil)
| ssList(sk5) ),
inference(fof_simplification,[status(thm)],[co1_8]) ).
cnf(c_0_29,negated_conjecture,
( neq(sk2,nil)
| nil = sk2 ),
co1_12 ).
cnf(c_0_30,negated_conjecture,
( ~ neq(sk4,nil)
| segmentP(sk4,sk5) ),
inference(fof_simplification,[status(thm)],[co1_10]) ).
cnf(c_0_31,negated_conjecture,
( ~ neq(sk4,nil)
| segmentP(sk3,sk5) ),
c_0_21 ).
cnf(c_0_32,negated_conjecture,
( ~ segmentP(sk4,sk4)
| ~ segmentP(sk1,sk4)
| sk1 != nil ),
inference(cn,[status(thm)],[inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_22,c_0_23]),c_0_24])]) ).
cnf(c_0_33,negated_conjecture,
( sk4 != nil
| sk1 = nil ),
inference(rw,[status(thm)],[c_0_25,c_0_26]) ).
cnf(c_0_34,plain,
( ~ ssList(X1)
| segmentP(X1,X1) ),
inference(fof_simplification,[status(thm)],[clause57]) ).
cnf(c_0_35,negated_conjecture,
( ~ segmentP(sk1,X1)
| ~ segmentP(sk2,X1)
| ~ neq(X1,nil)
| ~ ssList(X1)
| nil = sk2 ),
c_0_27 ).
cnf(c_0_36,negated_conjecture,
( ~ neq(sk4,nil)
| neq(sk5,nil) ),
inference(fof_simplification,[status(thm)],[co1_9]) ).
cnf(c_0_37,negated_conjecture,
( ~ neq(sk4,nil)
| ssList(sk5) ),
c_0_28 ).
cnf(c_0_38,negated_conjecture,
( neq(sk4,nil)
| sk4 = nil ),
inference(rw,[status(thm)],[inference(rw,[status(thm)],[c_0_29,c_0_18]),c_0_18]) ).
cnf(c_0_39,negated_conjecture,
( ~ neq(sk4,nil)
| segmentP(sk4,sk5) ),
c_0_30 ).
cnf(c_0_40,negated_conjecture,
( ~ neq(sk4,nil)
| segmentP(sk1,sk5) ),
inference(rw,[status(thm)],[c_0_31,c_0_26]) ).
cnf(c_0_41,plain,
( ~ ssList(X1)
| nil != X1
| segmentP(nil,X1) ),
inference(fof_simplification,[status(thm)],[clause79]) ).
cnf(c_0_42,negated_conjecture,
( ~ segmentP(sk4,sk4)
| ~ segmentP(nil,sk4)
| sk4 != nil ),
inference(spm,[status(thm)],[c_0_32,c_0_33]) ).
cnf(c_0_43,plain,
( ~ ssList(X1)
| segmentP(X1,X1) ),
c_0_34 ).
cnf(c_0_44,negated_conjecture,
( ~ ssList(X1)
| ~ segmentP(sk4,X1)
| ~ segmentP(sk1,X1)
| ~ neq(X1,nil)
| sk4 = nil ),
inference(rw,[status(thm)],[inference(rw,[status(thm)],[c_0_35,c_0_18]),c_0_18]) ).
cnf(c_0_45,negated_conjecture,
( ~ neq(sk4,nil)
| neq(sk5,nil) ),
c_0_36 ).
cnf(c_0_46,negated_conjecture,
( ssList(sk5)
| sk4 = nil ),
inference(spm,[status(thm)],[c_0_37,c_0_38]) ).
cnf(c_0_47,negated_conjecture,
( segmentP(sk4,sk5)
| sk4 = nil ),
inference(spm,[status(thm)],[c_0_39,c_0_38]) ).
cnf(c_0_48,negated_conjecture,
( segmentP(sk1,sk5)
| sk4 = nil ),
inference(spm,[status(thm)],[c_0_40,c_0_38]) ).
cnf(c_0_49,plain,
( ~ ssList(X1)
| nil != X1
| segmentP(nil,X1) ),
c_0_41 ).
cnf(c_0_50,axiom,
ssList(nil),
clause8 ).
cnf(c_0_51,negated_conjecture,
( ~ segmentP(nil,sk4)
| sk4 != nil ),
inference(cn,[status(thm)],[inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_42,c_0_43]),c_0_24])]) ).
cnf(c_0_52,negated_conjecture,
sk4 = nil,
inference(csr,[status(thm)],[inference(csr,[status(thm)],[inference(csr,[status(thm)],[inference(csr,[status(thm)],[inference(spm,[status(thm)],[c_0_44,c_0_45]),c_0_46]),c_0_47]),c_0_48]),c_0_38]) ).
cnf(c_0_53,plain,
segmentP(nil,nil),
inference(cn,[status(thm)],[inference(rw,[status(thm)],[inference(er,[status(thm)],[c_0_49]),c_0_50])]) ).
cnf(c_0_54,negated_conjecture,
$false,
inference(cn,[status(thm)],[inference(rw,[status(thm)],[inference(rw,[status(thm)],[inference(rw,[status(thm)],[c_0_51,c_0_52]),c_0_52]),c_0_53])]),
[proof] ).
%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.00/0.02 % Problem : SWC054-1 : TPTP v9.3.1. Released v2.4.0.
% 0.00/0.04 % Command : run_E /export/starexec/sandbox/benchmark/theBenchmark.p 300 THM
% 0.12/0.58 % Computer : n020.cluster.edu
% 0.12/0.58 % Model : x86_64 x86_64
% 0.12/0.58 % CPU : Intel(R) Xeon(R) CPU E5-2620 v4 @ 2.10GHz
% 0.12/0.58 % Memory : 8046.5625MB
% 0.12/0.58 % OS : Linux 6.8.0-71-generic
% 0.12/0.58 % CPULimit : 300
% 0.12/0.58 % WCLimit : 300
% 0.12/0.58 % DateTime : Mon Sep 21 07:52:48 UTC 2026
% 0.12/0.58 % CPUTime :
% 0.12/0.58 Running run_E /export/starexec/sandbox/benchmark/theBenchmark.p 300 THM
% 0.16/0.63 Running first-order theorem proving
% 0.16/0.63 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.16/0.66 % Version: 3.5.1
% 0.16/0.66 % Preprocessing class: FSLSSMSMSSSNFFN.
% 0.16/0.66 % Scheduled 4 strats onto 8 cores with 300 seconds (2400 total)
% 0.16/0.66 % Starting C07_19_nc_SOS_SAT001_MinMin_p005000_rr with 1500s (5) cores
% 0.16/0.66 % Starting new_bool_3 with 300s (1) cores
% 0.16/0.66 % Starting new_bool_1 with 300s (1) cores
% 0.16/0.66 % Starting sh5l with 300s (1) cores
% 0.16/0.66 % new_bool_3 with pid 2422507 completed with status 0
% 0.16/0.66 % Result found by new_bool_3
% 0.16/0.66 % Preprocessing class: FSLSSMSMSSSNFFN.
% 0.16/0.66 % Scheduled 4 strats onto 8 cores with 300 seconds (2400 total)
% 0.16/0.66 % Starting C07_19_nc_SOS_SAT001_MinMin_p005000_rr with 1500s (5) cores
% 0.16/0.66 % Starting new_bool_3 with 300s (1) cores
% 0.16/0.66 % (lift_lambdas = 0, lambda_to_forall = 0,unroll_only_formulas = 0, sine = GSinE(CountFormulas,hypos,1.5,,3,20000,1.0))
% 0.16/0.66 % SinE strategy is GSinE(CountFormulas,hypos,1.5,,3,20000,1.0)
% 0.16/0.66 % Search class: FGHSF-FFMM22-SFFFFFNN
% 0.16/0.66 % Scheduled 5 strats onto 1 cores with 300 seconds (300 total)
% 0.16/0.66 % Starting SubtermCWHack with 31s (1) cores
% 0.16/0.66 % SubtermCWHack with pid 2422517 completed with status 0
% 0.16/0.66 % Result found by SubtermCWHack
% 0.16/0.66 % Preprocessing class: FSLSSMSMSSSNFFN.
% 0.16/0.66 % Scheduled 4 strats onto 8 cores with 300 seconds (2400 total)
% 0.16/0.66 % Starting C07_19_nc_SOS_SAT001_MinMin_p005000_rr with 1500s (5) cores
% 0.16/0.66 % Starting new_bool_3 with 300s (1) cores
% 0.16/0.66 % (lift_lambdas = 0, lambda_to_forall = 0,unroll_only_formulas = 0, sine = GSinE(CountFormulas,hypos,1.5,,3,20000,1.0))
% 0.16/0.66 % SinE strategy is GSinE(CountFormulas,hypos,1.5,,3,20000,1.0)
% 0.16/0.66 % Search class: FGHSF-FFMM22-SFFFFFNN
% 0.16/0.66 % Scheduled 5 strats onto 1 cores with 300 seconds (300 total)
% 0.16/0.66 % Starting SubtermCWHack with 31s (1) cores
% 0.16/0.66 % Preprocessing time : 0.002 s
% 0.16/0.66
% 0.16/0.66 % Proof found!
% 0.16/0.66 % SZS status Unsatisfiable
% 0.16/0.66 % SZS output start CNFRefutation
% See solution above
% 0.16/0.66 % Parsed axioms : 200
% 0.16/0.66 % Removed by relevancy pruning/SinE : 156
% 0.16/0.66 % Initial clauses : 44
% 0.16/0.66 % Removed in clause preprocessing : 0
% 0.16/0.66 % Initial clauses in saturation : 44
% 0.16/0.66 % Processed clauses : 87
% 0.16/0.66 % ...of these trivial : 1
% 0.16/0.66 % ...subsumed : 21
% 0.16/0.66 % ...remaining for further processing : 65
% 0.16/0.66 % Other redundant clauses eliminated : 9
% 0.16/0.66 % Clauses deleted for lack of memory : 0
% 0.16/0.66 % Backward-subsumed : 2
% 0.16/0.66 % Backward-rewritten : 27
% 0.16/0.66 % Generated clauses : 95
% 0.16/0.66 % ...of the previous two non-redundant : 63
% 0.16/0.66 % ...aggressively subsumed : 0
% 0.16/0.66 % Contextual simplify-reflections : 11
% 0.16/0.66 % Paramodulations : 85
% 0.16/0.66 % Factorizations : 0
% 0.16/0.66 % NegExts : 0
% 0.16/0.66 % Equation resolutions : 11
% 0.16/0.66 % Disequality decompositions : 0
% 0.16/0.66 % Total rewrite steps : 66
% 0.16/0.66 % ...of those cached : 59
% 0.16/0.66 % Propositional unsat checks : 0
% 0.16/0.66 % Propositional check models : 0
% 0.16/0.66 % Propositional check unsatisfiable : 0
% 0.16/0.66 % Propositional clauses : 0
% 0.16/0.66 % Propositional clauses after purity: 0
% 0.16/0.66 % Propositional unsat core size : 0
% 0.16/0.66 % Propositional preprocessing time : 0.000
% 0.16/0.66 % Propositional encoding time : 0.000
% 0.16/0.66 % Propositional solver time : 0.000
% 0.16/0.66 % Success case prop preproc time : 0.000
% 0.16/0.66 % Success case prop encoding time : 0.000
% 0.16/0.66 % Success case prop solver time : 0.000
% 0.16/0.66 % Current number of processed clauses : 32
% 0.16/0.66 % Positive orientable unit clauses : 6
% 0.16/0.66 % Positive unorientable unit clauses: 0
% 0.16/0.66 % Negative unit clauses : 0
% 0.16/0.66 % Non-unit-clauses : 26
% 0.16/0.66 % Current number of unprocessed clauses: 20
% 0.16/0.66 % ...number of literals in the above : 111
% 0.16/0.66 % Current number of archived formulas : 0
% 0.16/0.66 % Current number of archived clauses : 29
% 0.16/0.66 % Clause-clause subsumption calls (NU) : 338
% 0.16/0.66 % Rec. Clause-clause subsumption calls : 203
% 0.16/0.66 % Non-unit clause-clause subsumptions : 34
% 0.16/0.66 % Unit Clause-clause subsumption calls : 14
% 0.16/0.66 % Rewrite failures with RHS unbound : 0
% 0.16/0.66 % BW rewrite match attempts : 3
% 0.16/0.66 % BW rewrite match successes : 3
% 0.16/0.66 % Condensation attempts : 0
% 0.16/0.66 % Condensation successes : 0
% 0.16/0.66 % Termbank termtop insertions : 4409
% 0.16/0.66 % Search garbage collected termcells : 928
% 0.16/0.66
% 0.16/0.66 % -------------------------------------------------
% 0.16/0.66 % User time : 0.011 s
% 0.16/0.66 % System time : 0.000 s
% 0.16/0.66 % Total time : 0.011 s
% 0.16/0.66 % Maximum resident set size: 3760 pages
% 0.16/0.66
% 0.16/0.66 % -------------------------------------------------
% 0.16/0.66 % User time : 0.015 s
% 0.16/0.66 % System time : 0.005 s
% 0.16/0.66 % Total time : 0.020 s
% 0.16/0.66 % Maximum resident set size: 5120 pages
% 0.16/0.66 % E exiting
%------------------------------------------------------------------------------