%------------------------------------------------------------------------------
% File : E---3.5.1
% Problem : SWC118-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:05 PM UTC 2026
% Result : Unsatisfiable 0.13s 0.45s
% Output : CNFRefutation 0.13s
% Verified :
% SZS Type : Refutation
% Derivation depth : 6
% Number of leaves : 13
% Syntax : Number of clauses : 38 ( 18 unt; 3 nHn; 38 RR)
% Number of literals : 77 ( 22 equ; 46 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 : 8 ( 8 usr; 7 con; 0-2 aty)
% Number of variables : 22 ( 0 sgn)
% Comments :
%------------------------------------------------------------------------------
cnf(co1_15,negated_conjecture,
( ~ segmentP(sk2,sk1)
| ~ neq(sk1,nil) ),
file('/export/starexec/sandbox/benchmark/theBenchmark.p',co1_15) ).
cnf(co1_14,negated_conjecture,
( nil != sk1
| nil != sk2 ),
file('/export/starexec/sandbox/benchmark/theBenchmark.p',co1_14) ).
cnf(co1_13,negated_conjecture,
( nil != sk3
| nil = sk4 ),
file('/export/starexec/sandbox/benchmark/theBenchmark.p',co1_13) ).
cnf(co1_5,negated_conjecture,
sk2 = sk4,
file('/export/starexec/sandbox/benchmark/theBenchmark.p',co1_5) ).
cnf(co1_6,negated_conjecture,
sk1 = sk3,
file('/export/starexec/sandbox/benchmark/theBenchmark.p',co1_6) ).
cnf(clause100,axiom,
( ~ ssList(X2)
| ~ ssList(X1)
| X2 = X1
| neq(X2,X1) ),
file('/export/starexec/sandbox/benchmark/Axioms/SWC001-0.ax',clause100) ).
cnf(clause172,axiom,
( ~ ssList(X1)
| ~ ssList(X2)
| ~ ssList(X4)
| ~ ssList(X3)
| ~ segmentP(X1,X2)
| segmentP(app(app(X4,X1),X3),X2) ),
file('/export/starexec/sandbox/benchmark/Axioms/SWC001-0.ax',clause172) ).
cnf(co1_3,negated_conjecture,
ssList(sk3),
file('/export/starexec/sandbox/benchmark/theBenchmark.p',co1_3) ).
cnf(clause8,axiom,
ssList(nil),
file('/export/starexec/sandbox/benchmark/Axioms/SWC001-0.ax',clause8) ).
cnf(co1_9,negated_conjecture,
app(app(sk5,sk3),sk6) = sk4,
file('/export/starexec/sandbox/benchmark/theBenchmark.p',co1_9) ).
cnf(co1_7,negated_conjecture,
ssList(sk5),
file('/export/starexec/sandbox/benchmark/theBenchmark.p',co1_7) ).
cnf(co1_8,negated_conjecture,
ssList(sk6),
file('/export/starexec/sandbox/benchmark/theBenchmark.p',co1_8) ).
cnf(clause57,axiom,
( ~ ssList(X1)
| segmentP(X1,X1) ),
file('/export/starexec/sandbox/benchmark/Axioms/SWC001-0.ax',clause57) ).
cnf(c_0_13,negated_conjecture,
( ~ segmentP(sk2,sk1)
| ~ neq(sk1,nil) ),
inference(fof_simplification,[status(thm)],[co1_15]) ).
cnf(c_0_14,negated_conjecture,
( nil != sk1
| nil != sk2 ),
inference(fof_simplification,[status(thm)],[co1_14]) ).
cnf(c_0_15,negated_conjecture,
( nil != sk3
| nil = sk4 ),
inference(fof_simplification,[status(thm)],[co1_13]) ).
cnf(c_0_16,negated_conjecture,
( ~ segmentP(sk2,sk1)
| ~ neq(sk1,nil) ),
c_0_13 ).
cnf(c_0_17,negated_conjecture,
sk2 = sk4,
co1_5 ).
cnf(c_0_18,negated_conjecture,
sk1 = sk3,
co1_6 ).
cnf(c_0_19,plain,
( ~ ssList(X2)
| ~ ssList(X1)
| X2 = X1
| neq(X2,X1) ),
inference(fof_simplification,[status(thm)],[clause100]) ).
cnf(c_0_20,negated_conjecture,
( nil != sk1
| nil != sk2 ),
c_0_14 ).
cnf(c_0_21,negated_conjecture,
( nil != sk3
| nil = sk4 ),
c_0_15 ).
cnf(c_0_22,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_23,negated_conjecture,
( ~ segmentP(sk4,sk3)
| ~ neq(sk3,nil) ),
inference(rw,[status(thm)],[inference(rw,[status(thm)],[inference(rw,[status(thm)],[c_0_16,c_0_17]),c_0_18]),c_0_18]) ).
cnf(c_0_24,plain,
( ~ ssList(X2)
| ~ ssList(X1)
| X2 = X1
| neq(X2,X1) ),
c_0_19 ).
cnf(c_0_25,negated_conjecture,
ssList(sk3),
co1_3 ).
cnf(c_0_26,axiom,
ssList(nil),
clause8 ).
cnf(c_0_27,negated_conjecture,
sk3 != nil,
inference(csr,[status(thm)],[inference(rw,[status(thm)],[inference(rw,[status(thm)],[c_0_20,c_0_18]),c_0_17]),c_0_21]) ).
cnf(c_0_28,plain,
( ~ ssList(X1)
| ~ ssList(X2)
| ~ ssList(X4)
| ~ ssList(X3)
| ~ segmentP(X1,X2)
| segmentP(app(app(X4,X1),X3),X2) ),
c_0_22 ).
cnf(c_0_29,negated_conjecture,
app(app(sk5,sk3),sk6) = sk4,
co1_9 ).
cnf(c_0_30,negated_conjecture,
ssList(sk5),
co1_7 ).
cnf(c_0_31,negated_conjecture,
ssList(sk6),
co1_8 ).
cnf(c_0_32,negated_conjecture,
~ segmentP(sk4,sk3),
inference(sr,[status(thm)],[inference(cn,[status(thm)],[inference(rw,[status(thm)],[inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_23,c_0_24]),c_0_25]),c_0_26])]),c_0_27]) ).
cnf(c_0_33,negated_conjecture,
( ~ ssList(X1)
| ~ segmentP(sk3,X1)
| segmentP(sk4,X1) ),
inference(cn,[status(thm)],[inference(rw,[status(thm)],[inference(rw,[status(thm)],[inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_28,c_0_29]),c_0_30]),c_0_31]),c_0_25])]) ).
cnf(c_0_34,plain,
( ~ ssList(X1)
| segmentP(X1,X1) ),
inference(fof_simplification,[status(thm)],[clause57]) ).
cnf(c_0_35,negated_conjecture,
~ segmentP(sk3,sk3),
inference(cn,[status(thm)],[inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_32,c_0_33]),c_0_25])]) ).
cnf(c_0_36,plain,
( ~ ssList(X1)
| segmentP(X1,X1) ),
c_0_34 ).
cnf(c_0_37,negated_conjecture,
$false,
inference(cn,[status(thm)],[inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_35,c_0_36]),c_0_25])]),
[proof] ).
%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.00/0.03 % Problem : SWC118-1 : TPTP v9.3.1. Released v2.4.0.
% 0.00/0.05 % Command : run_E /export/starexec/sandbox/benchmark/theBenchmark.p 300 THM
% 0.09/0.36 % Computer : n009.cluster.edu
% 0.09/0.36 % Model : x86_64 x86_64
% 0.09/0.36 % CPU : Intel(R) Xeon(R) CPU E5-2620 v4 @ 2.10GHz
% 0.09/0.36 % Memory : 8046.5625MB
% 0.09/0.36 % OS : Linux 6.8.0-71-generic
% 0.09/0.36 % CPULimit : 300
% 0.09/0.36 % WCLimit : 300
% 0.09/0.36 % DateTime : Mon Sep 21 07:57:13 UTC 2026
% 0.09/0.37 % CPUTime :
% 0.09/0.37 Running run_E /export/starexec/sandbox/benchmark/theBenchmark.p 300 THM
% 0.13/0.41 Running first-order theorem proving
% 0.13/0.41 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.13/0.45 % Version: 3.5.1
% 0.13/0.45 % Preprocessing class: FSLSSMSMSSSNFFN.
% 0.13/0.45 % Scheduled 4 strats onto 8 cores with 300 seconds (2400 total)
% 0.13/0.45 % Starting C07_19_nc_SOS_SAT001_MinMin_p005000_rr with 1500s (5) cores
% 0.13/0.45 % Starting new_bool_3 with 300s (1) cores
% 0.13/0.45 % Starting new_bool_1 with 300s (1) cores
% 0.13/0.45 % Starting sh5l with 300s (1) cores
% 0.13/0.45 % new_bool_3 with pid 1256160 completed with status 0
% 0.13/0.45 % Result found by new_bool_3
% 0.13/0.45 % Preprocessing class: FSLSSMSMSSSNFFN.
% 0.13/0.45 % Scheduled 4 strats onto 8 cores with 300 seconds (2400 total)
% 0.13/0.45 % Starting C07_19_nc_SOS_SAT001_MinMin_p005000_rr with 1500s (5) cores
% 0.13/0.45 % Starting new_bool_3 with 300s (1) cores
% 0.13/0.45 % (lift_lambdas = 0, lambda_to_forall = 0,unroll_only_formulas = 0, sine = GSinE(CountFormulas,hypos,1.5,,3,20000,1.0))
% 0.13/0.45 % SinE strategy is GSinE(CountFormulas,hypos,1.5,,3,20000,1.0)
% 0.13/0.45 % Search class: FGHSF-FFMM21-MFFFFFNN
% 0.13/0.45 % Scheduled 5 strats onto 1 cores with 300 seconds (300 total)
% 0.13/0.45 % Starting SubtermCWHack with 31s (1) cores
% 0.13/0.45 % SubtermCWHack with pid 1256164 completed with status 0
% 0.13/0.45 % Result found by SubtermCWHack
% 0.13/0.45 % Preprocessing class: FSLSSMSMSSSNFFN.
% 0.13/0.45 % Scheduled 4 strats onto 8 cores with 300 seconds (2400 total)
% 0.13/0.45 % Starting C07_19_nc_SOS_SAT001_MinMin_p005000_rr with 1500s (5) cores
% 0.13/0.45 % Starting new_bool_3 with 300s (1) cores
% 0.13/0.45 % (lift_lambdas = 0, lambda_to_forall = 0,unroll_only_formulas = 0, sine = GSinE(CountFormulas,hypos,1.5,,3,20000,1.0))
% 0.13/0.45 % SinE strategy is GSinE(CountFormulas,hypos,1.5,,3,20000,1.0)
% 0.13/0.45 % Search class: FGHSF-FFMM21-MFFFFFNN
% 0.13/0.45 % Scheduled 5 strats onto 1 cores with 300 seconds (300 total)
% 0.13/0.45 % Starting SubtermCWHack with 31s (1) cores
% 0.13/0.45 % Preprocessing time : 0.003 s
% 0.13/0.45
% 0.13/0.45 % Proof found!
% 0.13/0.45 % SZS status Unsatisfiable
% 0.13/0.45 % SZS output start CNFRefutation
% See solution above
% 0.13/0.45 % Parsed axioms : 200
% 0.13/0.45 % Removed by relevancy pruning/SinE : 127
% 0.13/0.45 % Initial clauses : 73
% 0.13/0.45 % Removed in clause preprocessing : 0
% 0.13/0.45 % Initial clauses in saturation : 73
% 0.13/0.45 % Processed clauses : 145
% 0.13/0.45 % ...of these trivial : 0
% 0.13/0.45 % ...subsumed : 30
% 0.13/0.45 % ...remaining for further processing : 115
% 0.13/0.45 % Other redundant clauses eliminated : 13
% 0.13/0.45 % Clauses deleted for lack of memory : 0
% 0.13/0.45 % Backward-subsumed : 14
% 0.13/0.45 % Backward-rewritten : 3
% 0.13/0.45 % Generated clauses : 306
% 0.13/0.45 % ...of the previous two non-redundant : 243
% 0.13/0.45 % ...aggressively subsumed : 0
% 0.13/0.45 % Contextual simplify-reflections : 4
% 0.13/0.45 % Paramodulations : 290
% 0.13/0.45 % Factorizations : 0
% 0.13/0.45 % NegExts : 0
% 0.13/0.45 % Equation resolutions : 17
% 0.13/0.45 % Disequality decompositions : 0
% 0.13/0.45 % Total rewrite steps : 269
% 0.13/0.45 % ...of those cached : 260
% 0.13/0.45 % Propositional unsat checks : 0
% 0.13/0.45 % Propositional check models : 0
% 0.13/0.45 % Propositional check unsatisfiable : 0
% 0.13/0.45 % Propositional clauses : 0
% 0.13/0.45 % Propositional clauses after purity: 0
% 0.13/0.45 % Propositional unsat core size : 0
% 0.13/0.45 % Propositional preprocessing time : 0.000
% 0.13/0.45 % Propositional encoding time : 0.000
% 0.13/0.45 % Propositional solver time : 0.000
% 0.13/0.45 % Success case prop preproc time : 0.000
% 0.13/0.45 % Success case prop encoding time : 0.000
% 0.13/0.45 % Success case prop solver time : 0.000
% 0.13/0.45 % Current number of processed clauses : 90
% 0.13/0.45 % Positive orientable unit clauses : 15
% 0.13/0.45 % Positive unorientable unit clauses: 0
% 0.13/0.45 % Negative unit clauses : 6
% 0.13/0.45 % Non-unit-clauses : 69
% 0.13/0.45 % Current number of unprocessed clauses: 151
% 0.13/0.45 % ...number of literals in the above : 824
% 0.13/0.45 % Current number of archived formulas : 0
% 0.13/0.45 % Current number of archived clauses : 17
% 0.13/0.45 % Clause-clause subsumption calls (NU) : 1119
% 0.13/0.45 % Rec. Clause-clause subsumption calls : 361
% 0.13/0.45 % Non-unit clause-clause subsumptions : 38
% 0.13/0.45 % Unit Clause-clause subsumption calls : 94
% 0.13/0.45 % Rewrite failures with RHS unbound : 0
% 0.13/0.45 % BW rewrite match attempts : 3
% 0.13/0.45 % BW rewrite match successes : 3
% 0.13/0.45 % Condensation attempts : 0
% 0.13/0.45 % Condensation successes : 0
% 0.13/0.45 % Termbank termtop insertions : 9362
% 0.13/0.45 % Search garbage collected termcells : 875
% 0.13/0.45
% 0.13/0.45 % -------------------------------------------------
% 0.13/0.45 % User time : 0.015 s
% 0.13/0.45 % System time : 0.006 s
% 0.13/0.45 % Total time : 0.021 s
% 0.13/0.45 % Maximum resident set size: 4068 pages
% 0.13/0.45
% 0.13/0.45 % -------------------------------------------------
% 0.13/0.45 % User time : 0.020 s
% 0.13/0.45 % System time : 0.013 s
% 0.13/0.45 % Total time : 0.033 s
% 0.13/0.45 % Maximum resident set size: 5120 pages
% 0.13/0.45 % E exiting
%------------------------------------------------------------------------------