%------------------------------------------------------------------------------
% File : E---3.5.1
% Problem : SWC364-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 : n014.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:06 PM UTC 2026
% Result : Unsatisfiable 0.57s 0.53s
% Output : CNFRefutation 0.57s
% Verified :
% SZS Type : Refutation
% Derivation depth : 7
% Number of leaves : 13
% Syntax : Number of clauses : 41 ( 16 unt; 1 nHn; 41 RR)
% Number of literals : 87 ( 11 equ; 49 neg)
% Maximal clause size : 6 ( 2 avg)
% Maximal term depth : 3 ( 1 avg)
% Number of predicates : 6 ( 4 usr; 1 prp; 0-2 aty)
% Number of functors : 8 ( 8 usr; 6 con; 0-2 aty)
% Number of variables : 28 ( 0 sgn)
% Comments :
%------------------------------------------------------------------------------
cnf(co1_13,negated_conjecture,
( ~ neq(sk4,nil)
| app(cons(sk5,nil),sk3) = sk4 ),
file('/export/starexec/sandbox2/benchmark/theBenchmark.p',co1_13) ).
cnf(co1_7,negated_conjecture,
( neq(sk2,nil)
| neq(sk2,nil) ),
file('/export/starexec/sandbox2/benchmark/theBenchmark.p',co1_7) ).
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_6,negated_conjecture,
sk1 = sk3,
file('/export/starexec/sandbox2/benchmark/theBenchmark.p',co1_6) ).
cnf(co1_5,negated_conjecture,
sk2 = sk4,
file('/export/starexec/sandbox2/benchmark/theBenchmark.p',co1_5) ).
cnf(co1_1,negated_conjecture,
ssList(sk1),
file('/export/starexec/sandbox2/benchmark/theBenchmark.p',co1_1) ).
cnf(clause73,axiom,
( ~ ssList(X1)
| app(X1,nil) = X1 ),
file('/export/starexec/sandbox2/benchmark/Axioms/SWC001-0.ax',clause73) ).
cnf(co1_12,negated_conjecture,
( ~ neq(sk4,nil)
| ssItem(sk5) ),
file('/export/starexec/sandbox2/benchmark/theBenchmark.p',co1_12) ).
cnf(clause8,axiom,
ssList(nil),
file('/export/starexec/sandbox2/benchmark/Axioms/SWC001-0.ax',clause8) ).
cnf(co1_2,negated_conjecture,
ssList(sk2),
file('/export/starexec/sandbox2/benchmark/theBenchmark.p',co1_2) ).
cnf(clause86,axiom,
( ~ ssList(X2)
| ~ ssItem(X1)
| ssList(cons(X1,X2)) ),
file('/export/starexec/sandbox2/benchmark/Axioms/SWC001-0.ax',clause86) ).
cnf(co1_14,negated_conjecture,
( ~ neq(sk4,nil)
| ~ segmentP(sk2,sk1) ),
file('/export/starexec/sandbox2/benchmark/theBenchmark.p',co1_14) ).
cnf(clause57,axiom,
( ~ ssList(X1)
| segmentP(X1,X1) ),
file('/export/starexec/sandbox2/benchmark/Axioms/SWC001-0.ax',clause57) ).
cnf(c_0_13,negated_conjecture,
( ~ neq(sk4,nil)
| app(cons(sk5,nil),sk3) = sk4 ),
inference(fof_simplification,[status(thm)],[co1_13]) ).
cnf(c_0_14,negated_conjecture,
neq(sk2,nil),
inference(fof_simplification,[status(thm)],[co1_7]) ).
cnf(c_0_15,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_16,negated_conjecture,
( ~ neq(sk4,nil)
| app(cons(sk5,nil),sk3) = sk4 ),
c_0_13 ).
cnf(c_0_17,negated_conjecture,
sk1 = sk3,
co1_6 ).
cnf(c_0_18,negated_conjecture,
sk2 = sk4,
co1_5 ).
cnf(c_0_19,negated_conjecture,
neq(sk2,nil),
c_0_14 ).
cnf(c_0_20,plain,
( ~ ssList(X1)
| ~ ssList(X2)
| ~ ssList(X4)
| ~ ssList(X3)
| ~ segmentP(X1,X2)
| segmentP(app(app(X4,X1),X3),X2) ),
c_0_15 ).
cnf(c_0_21,negated_conjecture,
app(cons(sk5,nil),sk1) = sk2,
inference(cn,[status(thm)],[inference(rw,[status(thm)],[inference(rw,[status(thm)],[inference(rw,[status(thm)],[inference(rw,[status(thm)],[c_0_16,c_0_17]),c_0_18]),c_0_18]),c_0_19])]) ).
cnf(c_0_22,negated_conjecture,
ssList(sk1),
co1_1 ).
cnf(c_0_23,plain,
( ~ ssList(X1)
| app(X1,nil) = X1 ),
inference(fof_simplification,[status(thm)],[clause73]) ).
cnf(c_0_24,negated_conjecture,
( ~ neq(sk4,nil)
| ssItem(sk5) ),
inference(fof_simplification,[status(thm)],[co1_12]) ).
cnf(c_0_25,negated_conjecture,
( ~ ssList(X2)
| ~ ssList(X1)
| ~ ssList(cons(sk5,nil))
| ~ segmentP(sk1,X2)
| segmentP(app(sk2,X1),X2) ),
inference(cn,[status(thm)],[inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_20,c_0_21]),c_0_22])]) ).
cnf(c_0_26,plain,
( ~ ssList(X1)
| app(X1,nil) = X1 ),
c_0_23 ).
cnf(c_0_27,axiom,
ssList(nil),
clause8 ).
cnf(c_0_28,negated_conjecture,
ssList(sk2),
co1_2 ).
cnf(c_0_29,plain,
( ~ ssList(X2)
| ~ ssItem(X1)
| ssList(cons(X1,X2)) ),
inference(fof_simplification,[status(thm)],[clause86]) ).
cnf(c_0_30,negated_conjecture,
( ~ neq(sk4,nil)
| ssItem(sk5) ),
c_0_24 ).
cnf(c_0_31,negated_conjecture,
( ~ neq(sk4,nil)
| ~ segmentP(sk2,sk1) ),
inference(fof_simplification,[status(thm)],[co1_14]) ).
cnf(c_0_32,negated_conjecture,
( ~ ssList(X1)
| ~ ssList(cons(sk5,nil))
| ~ segmentP(sk1,X1)
| segmentP(sk2,X1) ),
inference(cn,[status(thm)],[inference(rw,[status(thm)],[inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_25,c_0_26]),c_0_27]),c_0_28])]) ).
cnf(c_0_33,plain,
( ~ ssList(X2)
| ~ ssItem(X1)
| ssList(cons(X1,X2)) ),
c_0_29 ).
cnf(c_0_34,negated_conjecture,
ssItem(sk5),
inference(cn,[status(thm)],[inference(rw,[status(thm)],[inference(rw,[status(thm)],[c_0_30,c_0_18]),c_0_19])]) ).
cnf(c_0_35,plain,
( ~ ssList(X1)
| segmentP(X1,X1) ),
inference(fof_simplification,[status(thm)],[clause57]) ).
cnf(c_0_36,negated_conjecture,
( ~ neq(sk4,nil)
| ~ segmentP(sk2,sk1) ),
c_0_31 ).
cnf(c_0_37,negated_conjecture,
( ~ ssList(X1)
| ~ segmentP(sk1,X1)
| segmentP(sk2,X1) ),
inference(cn,[status(thm)],[inference(rw,[status(thm)],[inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_32,c_0_33]),c_0_34]),c_0_27])]) ).
cnf(c_0_38,plain,
( ~ ssList(X1)
| segmentP(X1,X1) ),
c_0_35 ).
cnf(c_0_39,negated_conjecture,
~ segmentP(sk2,sk1),
inference(cn,[status(thm)],[inference(rw,[status(thm)],[inference(rw,[status(thm)],[c_0_36,c_0_18]),c_0_19])]) ).
cnf(c_0_40,negated_conjecture,
$false,
inference(sr,[status(thm)],[inference(cn,[status(thm)],[inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_37,c_0_38]),c_0_22])]),c_0_39]),
[proof] ).
%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.00/0.03 % Problem : SWC364-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.09/0.35 % Computer : n014.cluster.edu
% 0.09/0.35 % Model : x86_64 x86_64
% 0.09/0.35 % CPU : Intel(R) Xeon(R) CPU E5-2620 v4 @ 2.10GHz
% 0.09/0.35 % Memory : 8046.5625MB
% 0.09/0.35 % OS : Linux 6.8.0-71-generic
% 0.09/0.35 % CPULimit : 300
% 0.09/0.35 % WCLimit : 300
% 0.09/0.35 % DateTime : Mon Sep 21 08:18:51 UTC 2026
% 0.09/0.36 % CPUTime :
% 0.14/0.36 Running run_E /export/starexec/sandbox2/benchmark/theBenchmark.p 300 THM
% 0.14/0.40 Running first-order theorem proving
% 0.14/0.40 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.57/0.53 % Version: 3.5.1
% 0.57/0.53 % Preprocessing class: FSLSSMSMSSSNFFN.
% 0.57/0.53 % Scheduled 4 strats onto 8 cores with 300 seconds (2400 total)
% 0.57/0.53 % Starting C07_19_nc_SOS_SAT001_MinMin_p005000_rr with 1500s (5) cores
% 0.57/0.53 % Starting new_bool_3 with 300s (1) cores
% 0.57/0.53 % Starting new_bool_1 with 300s (1) cores
% 0.57/0.53 % Starting sh5l with 300s (1) cores
% 0.57/0.53 % new_bool_1 with pid 3622837 completed with status 0
% 0.57/0.53 % Result found by new_bool_1
% 0.57/0.53 % Preprocessing class: FSLSSMSMSSSNFFN.
% 0.57/0.53 % Scheduled 4 strats onto 8 cores with 300 seconds (2400 total)
% 0.57/0.53 % Starting C07_19_nc_SOS_SAT001_MinMin_p005000_rr with 1500s (5) cores
% 0.57/0.53 % Starting new_bool_3 with 300s (1) cores
% 0.57/0.53 % Starting new_bool_1 with 300s (1) cores
% 0.57/0.53 % (lift_lambdas = 0, lambda_to_forall = 0,unroll_only_formulas = 0, sine = GSinE(CountFormulas,hypos,1.5,,3,20000,1.0))
% 0.57/0.53 % SinE strategy is GSinE(CountFormulas,hypos,1.5,,3,20000,1.0)
% 0.57/0.53 % Search class: FGHSF-FFMM22-SFFFFFNN
% 0.57/0.53 % Scheduled 5 strats onto 1 cores with 300 seconds (300 total)
% 0.57/0.53 % Starting SubtermCWHack with 31s (1) cores
% 0.57/0.53 % SubtermCWHack with pid 3622845 completed with status 0
% 0.57/0.53 % Result found by SubtermCWHack
% 0.57/0.53 % Preprocessing class: FSLSSMSMSSSNFFN.
% 0.57/0.53 % Scheduled 4 strats onto 8 cores with 300 seconds (2400 total)
% 0.57/0.53 % Starting C07_19_nc_SOS_SAT001_MinMin_p005000_rr with 1500s (5) cores
% 0.57/0.53 % Starting new_bool_3 with 300s (1) cores
% 0.57/0.53 % Starting new_bool_1 with 300s (1) cores
% 0.57/0.53 % (lift_lambdas = 0, lambda_to_forall = 0,unroll_only_formulas = 0, sine = GSinE(CountFormulas,hypos,1.5,,3,20000,1.0))
% 0.57/0.53 % SinE strategy is GSinE(CountFormulas,hypos,1.5,,3,20000,1.0)
% 0.57/0.53 % Search class: FGHSF-FFMM22-SFFFFFNN
% 0.57/0.53 % Scheduled 5 strats onto 1 cores with 300 seconds (300 total)
% 0.57/0.53 % Starting SubtermCWHack with 31s (1) cores
% 0.57/0.53 % Preprocessing time : 0.002 s
% 0.57/0.53
% 0.57/0.53 % Proof found!
% 0.57/0.53 % SZS status Unsatisfiable
% 0.57/0.53 % SZS output start CNFRefutation
% See solution above
% 0.57/0.53 % Parsed axioms : 199
% 0.57/0.53 % Removed by relevancy pruning/SinE : 156
% 0.57/0.53 % Initial clauses : 43
% 0.57/0.53 % Removed in clause preprocessing : 0
% 0.57/0.53 % Initial clauses in saturation : 43
% 0.57/0.53 % Processed clauses : 1085
% 0.57/0.53 % ...of these trivial : 23
% 0.57/0.53 % ...subsumed : 703
% 0.57/0.53 % ...remaining for further processing : 359
% 0.57/0.53 % Other redundant clauses eliminated : 20
% 0.57/0.53 % Clauses deleted for lack of memory : 0
% 0.57/0.53 % Backward-subsumed : 28
% 0.57/0.53 % Backward-rewritten : 5
% 0.57/0.53 % Generated clauses : 4508
% 0.57/0.53 % ...of the previous two non-redundant : 3679
% 0.57/0.53 % ...aggressively subsumed : 0
% 0.57/0.53 % Contextual simplify-reflections : 56
% 0.57/0.53 % Paramodulations : 4479
% 0.57/0.53 % Factorizations : 0
% 0.57/0.53 % NegExts : 0
% 0.57/0.53 % Equation resolutions : 30
% 0.57/0.53 % Disequality decompositions : 0
% 0.57/0.53 % Total rewrite steps : 4961
% 0.57/0.53 % ...of those cached : 4931
% 0.57/0.53 % Propositional unsat checks : 0
% 0.57/0.53 % Propositional check models : 0
% 0.57/0.53 % Propositional check unsatisfiable : 0
% 0.57/0.53 % Propositional clauses : 0
% 0.57/0.53 % Propositional clauses after purity: 0
% 0.57/0.53 % Propositional unsat core size : 0
% 0.57/0.53 % Propositional preprocessing time : 0.000
% 0.57/0.53 % Propositional encoding time : 0.000
% 0.57/0.53 % Propositional solver time : 0.000
% 0.57/0.53 % Success case prop preproc time : 0.000
% 0.57/0.53 % Success case prop encoding time : 0.000
% 0.57/0.53 % Success case prop solver time : 0.000
% 0.57/0.53 % Current number of processed clauses : 321
% 0.57/0.53 % Positive orientable unit clauses : 42
% 0.57/0.53 % Positive unorientable unit clauses: 0
% 0.57/0.53 % Negative unit clauses : 31
% 0.57/0.53 % Non-unit-clauses : 248
% 0.57/0.53 % Current number of unprocessed clauses: 2608
% 0.57/0.53 % ...number of literals in the above : 13926
% 0.57/0.53 % Current number of archived formulas : 0
% 0.57/0.53 % Current number of archived clauses : 33
% 0.57/0.53 % Clause-clause subsumption calls (NU) : 13380
% 0.57/0.53 % Rec. Clause-clause subsumption calls : 7341
% 0.57/0.53 % Non-unit clause-clause subsumptions : 628
% 0.57/0.53 % Unit Clause-clause subsumption calls : 999
% 0.57/0.53 % Rewrite failures with RHS unbound : 0
% 0.57/0.53 % BW rewrite match attempts : 259
% 0.57/0.53 % BW rewrite match successes : 8
% 0.57/0.53 % Condensation attempts : 0
% 0.57/0.53 % Condensation successes : 0
% 0.57/0.53 % Termbank termtop insertions : 79460
% 0.57/0.53 % Search garbage collected termcells : 911
% 0.57/0.53
% 0.57/0.53 % -------------------------------------------------
% 0.57/0.53 % User time : 0.084 s
% 0.57/0.53 % System time : 0.010 s
% 0.57/0.53 % Total time : 0.094 s
% 0.57/0.53 % Maximum resident set size: 3812 pages
% 0.57/0.53
% 0.57/0.53 % -------------------------------------------------
% 0.57/0.53 % User time : 0.088 s
% 0.57/0.53 % System time : 0.016 s
% 0.57/0.53 % Total time : 0.103 s
% 0.57/0.53 % Maximum resident set size: 5120 pages
% 0.57/0.53 % E exiting
%------------------------------------------------------------------------------