%------------------------------------------------------------------------------
% File : E---3.5.1
% Problem : SWC071-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 : n003.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:52 PM UTC 2026
% Result : Unsatisfiable 0.10s 0.47s
% Output : CNFRefutation 0.10s
% Verified :
% SZS Type : Refutation
% Derivation depth : 8
% Number of leaves : 15
% Syntax : Number of clauses : 46 ( 13 unt; 13 nHn; 46 RR)
% Number of literals : 112 ( 36 equ; 65 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 : 10 ( 10 usr; 8 con; 0-2 aty)
% Number of variables : 34 ( 0 sgn)
% Comments :
%------------------------------------------------------------------------------
cnf(co1_8,negated_conjecture,
( nil != sk1
| nil != sk2 ),
file('/export/starexec/sandbox/benchmark/theBenchmark.p',co1_8) ).
cnf(clause98,axiom,
( ~ ssList(X2)
| ~ ssItem(X1)
| cons(X1,X2) != nil ),
file('/export/starexec/sandbox/benchmark/Axioms/SWC001-0.ax',clause98) ).
cnf(co1_6,negated_conjecture,
sk1 = sk3,
file('/export/starexec/sandbox/benchmark/theBenchmark.p',co1_6) ).
cnf(co1_5,negated_conjecture,
sk2 = sk4,
file('/export/starexec/sandbox/benchmark/theBenchmark.p',co1_5) ).
cnf(co1_7,negated_conjecture,
( ~ segmentP(sk1,X1)
| ~ segmentP(sk2,X1)
| ~ neq(X1,nil)
| ~ ssList(X1) ),
file('/export/starexec/sandbox/benchmark/theBenchmark.p',co1_7) ).
cnf(co1_13,negated_conjecture,
( nil = sk4
| cons(sk5,nil) = sk3 ),
file('/export/starexec/sandbox/benchmark/theBenchmark.p',co1_13) ).
cnf(clause8,axiom,
ssList(nil),
file('/export/starexec/sandbox/benchmark/Axioms/SWC001-0.ax',clause8) ).
cnf(co1_9,negated_conjecture,
( nil = sk4
| ssItem(sk5) ),
file('/export/starexec/sandbox/benchmark/theBenchmark.p',co1_9) ).
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_20,negated_conjecture,
( nil = sk3
| app(app(sk6,sk3),sk7) = sk4 ),
file('/export/starexec/sandbox/benchmark/theBenchmark.p',co1_20) ).
cnf(co1_17,negated_conjecture,
( nil = sk3
| ssList(sk6) ),
file('/export/starexec/sandbox/benchmark/theBenchmark.p',co1_17) ).
cnf(co1_18,negated_conjecture,
( nil = sk3
| ssList(sk7) ),
file('/export/starexec/sandbox/benchmark/theBenchmark.p',co1_18) ).
cnf(co1_3,negated_conjecture,
ssList(sk3),
file('/export/starexec/sandbox/benchmark/theBenchmark.p',co1_3) ).
cnf(clause57,axiom,
( ~ ssList(X1)
| segmentP(X1,X1) ),
file('/export/starexec/sandbox/benchmark/Axioms/SWC001-0.ax',clause57) ).
cnf(c_0_15,negated_conjecture,
( nil != sk1
| nil != sk2 ),
inference(fof_simplification,[status(thm)],[co1_8]) ).
cnf(c_0_16,plain,
( ~ ssList(X2)
| ~ ssItem(X1)
| cons(X1,X2) != nil ),
inference(fof_simplification,[status(thm)],[clause98]) ).
cnf(c_0_17,negated_conjecture,
( nil != sk1
| nil != sk2 ),
c_0_15 ).
cnf(c_0_18,negated_conjecture,
sk1 = sk3,
co1_6 ).
cnf(c_0_19,negated_conjecture,
sk2 = sk4,
co1_5 ).
cnf(c_0_20,negated_conjecture,
( ~ segmentP(sk1,X1)
| ~ segmentP(sk2,X1)
| ~ neq(X1,nil)
| ~ ssList(X1) ),
inference(fof_simplification,[status(thm)],[co1_7]) ).
cnf(c_0_21,plain,
( ~ ssList(X2)
| ~ ssItem(X1)
| cons(X1,X2) != nil ),
c_0_16 ).
cnf(c_0_22,negated_conjecture,
( nil = sk4
| cons(sk5,nil) = sk3 ),
co1_13 ).
cnf(c_0_23,axiom,
ssList(nil),
clause8 ).
cnf(c_0_24,negated_conjecture,
( nil = sk4
| ssItem(sk5) ),
co1_9 ).
cnf(c_0_25,negated_conjecture,
( sk4 != nil
| sk3 != nil ),
inference(rw,[status(thm)],[inference(rw,[status(thm)],[c_0_17,c_0_18]),c_0_19]) ).
cnf(c_0_26,negated_conjecture,
( ~ segmentP(sk1,X1)
| ~ segmentP(sk2,X1)
| ~ neq(X1,nil)
| ~ ssList(X1) ),
c_0_20 ).
cnf(c_0_27,plain,
( ~ ssList(X2)
| ~ ssList(X1)
| X2 = X1
| neq(X2,X1) ),
inference(fof_simplification,[status(thm)],[clause100]) ).
cnf(c_0_28,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_29,negated_conjecture,
( nil = sk3
| app(app(sk6,sk3),sk7) = sk4 ),
co1_20 ).
cnf(c_0_30,negated_conjecture,
sk3 != nil,
inference(csr,[status(thm)],[inference(csr,[status(thm)],[inference(cn,[status(thm)],[inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_21,c_0_22]),c_0_23])]),c_0_24]),c_0_25]) ).
cnf(c_0_31,negated_conjecture,
( nil = sk3
| ssList(sk6) ),
co1_17 ).
cnf(c_0_32,negated_conjecture,
( nil = sk3
| ssList(sk7) ),
co1_18 ).
cnf(c_0_33,negated_conjecture,
( ~ ssList(X1)
| ~ segmentP(sk4,X1)
| ~ segmentP(sk3,X1)
| ~ neq(X1,nil) ),
inference(rw,[status(thm)],[inference(rw,[status(thm)],[c_0_26,c_0_18]),c_0_19]) ).
cnf(c_0_34,plain,
( ~ ssList(X2)
| ~ ssList(X1)
| X2 = X1
| neq(X2,X1) ),
c_0_27 ).
cnf(c_0_35,plain,
( ~ ssList(X1)
| ~ ssList(X2)
| ~ ssList(X4)
| ~ ssList(X3)
| ~ segmentP(X1,X2)
| segmentP(app(app(X4,X1),X3),X2) ),
c_0_28 ).
cnf(c_0_36,negated_conjecture,
app(app(sk6,sk3),sk7) = sk4,
inference(sr,[status(thm)],[c_0_29,c_0_30]) ).
cnf(c_0_37,negated_conjecture,
ssList(sk6),
inference(sr,[status(thm)],[c_0_31,c_0_30]) ).
cnf(c_0_38,negated_conjecture,
ssList(sk7),
inference(sr,[status(thm)],[c_0_32,c_0_30]) ).
cnf(c_0_39,negated_conjecture,
ssList(sk3),
co1_3 ).
cnf(c_0_40,negated_conjecture,
( ~ ssList(X1)
| ~ segmentP(sk4,X1)
| ~ segmentP(sk3,X1)
| nil = X1 ),
inference(cn,[status(thm)],[inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_33,c_0_34]),c_0_23])]) ).
cnf(c_0_41,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_35,c_0_36]),c_0_37]),c_0_38]),c_0_39])]) ).
cnf(c_0_42,plain,
( ~ ssList(X1)
| segmentP(X1,X1) ),
inference(fof_simplification,[status(thm)],[clause57]) ).
cnf(c_0_43,negated_conjecture,
( ~ ssList(X1)
| ~ segmentP(sk3,X1)
| nil = X1 ),
inference(spm,[status(thm)],[c_0_40,c_0_41]) ).
cnf(c_0_44,plain,
( ~ ssList(X1)
| segmentP(X1,X1) ),
c_0_42 ).
cnf(c_0_45,negated_conjecture,
$false,
inference(sr,[status(thm)],[inference(cn,[status(thm)],[inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_43,c_0_44]),c_0_39])]),c_0_30]),
[proof] ).
%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.00/0.03 % Problem : SWC071-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.10/0.37 % Computer : n003.cluster.edu
% 0.10/0.37 % Model : x86_64 x86_64
% 0.10/0.37 % CPU : Intel(R) Xeon(R) CPU E5-2620 v4 @ 2.10GHz
% 0.10/0.37 % Memory : 8046.5625MB
% 0.10/0.37 % OS : Linux 6.8.0-71-generic
% 0.10/0.37 % CPULimit : 300
% 0.10/0.37 % WCLimit : 300
% 0.10/0.37 % DateTime : Mon Sep 21 07:55:16 UTC 2026
% 0.10/0.37 % CPUTime :
% 0.10/0.37 Running run_E /export/starexec/sandbox/benchmark/theBenchmark.p 300 THM
% 0.10/0.42 Running first-order theorem proving
% 0.10/0.42 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.10/0.47 % Version: 3.5.1
% 0.10/0.47 % Preprocessing class: FSLSSMSMSSSNFFN.
% 0.10/0.47 % Scheduled 4 strats onto 8 cores with 300 seconds (2400 total)
% 0.10/0.47 % Starting C07_19_nc_SOS_SAT001_MinMin_p005000_rr with 1500s (5) cores
% 0.10/0.47 % Starting new_bool_3 with 300s (1) cores
% 0.10/0.47 % Starting new_bool_1 with 300s (1) cores
% 0.10/0.47 % Starting sh5l with 300s (1) cores
% 0.10/0.47 % new_bool_1 with pid 3797352 completed with status 0
% 0.10/0.47 % Result found by new_bool_1
% 0.10/0.47 % Preprocessing class: FSLSSMSMSSSNFFN.
% 0.10/0.47 % Scheduled 4 strats onto 8 cores with 300 seconds (2400 total)
% 0.10/0.47 % Starting C07_19_nc_SOS_SAT001_MinMin_p005000_rr with 1500s (5) cores
% 0.10/0.47 % Starting new_bool_3 with 300s (1) cores
% 0.10/0.47 % Starting new_bool_1 with 300s (1) cores
% 0.10/0.47 % (lift_lambdas = 0, lambda_to_forall = 0,unroll_only_formulas = 0, sine = GSinE(CountFormulas,hypos,1.5,,3,20000,1.0))
% 0.10/0.47 % SinE strategy is GSinE(CountFormulas,hypos,1.5,,3,20000,1.0)
% 0.10/0.47 % Search class: FGHSF-FFMM22-SFFFFFNN
% 0.10/0.47 % Scheduled 5 strats onto 1 cores with 300 seconds (300 total)
% 0.10/0.47 % Starting SubtermCWHack with 31s (1) cores
% 0.10/0.47 % SubtermCWHack with pid 3797363 completed with status 0
% 0.10/0.47 % Result found by SubtermCWHack
% 0.10/0.47 % Preprocessing class: FSLSSMSMSSSNFFN.
% 0.10/0.47 % Scheduled 4 strats onto 8 cores with 300 seconds (2400 total)
% 0.10/0.47 % Starting C07_19_nc_SOS_SAT001_MinMin_p005000_rr with 1500s (5) cores
% 0.10/0.47 % Starting new_bool_3 with 300s (1) cores
% 0.10/0.47 % Starting new_bool_1 with 300s (1) cores
% 0.10/0.47 % (lift_lambdas = 0, lambda_to_forall = 0,unroll_only_formulas = 0, sine = GSinE(CountFormulas,hypos,1.5,,3,20000,1.0))
% 0.10/0.47 % SinE strategy is GSinE(CountFormulas,hypos,1.5,,3,20000,1.0)
% 0.10/0.47 % Search class: FGHSF-FFMM22-SFFFFFNN
% 0.10/0.47 % Scheduled 5 strats onto 1 cores with 300 seconds (300 total)
% 0.10/0.47 % Starting SubtermCWHack with 31s (1) cores
% 0.10/0.47 % Preprocessing time : 0.001 s
% 0.10/0.47
% 0.10/0.47 % Proof found!
% 0.10/0.47 % SZS status Unsatisfiable
% 0.10/0.47 % SZS output start CNFRefutation
% See solution above
% 0.10/0.47 % Parsed axioms : 207
% 0.10/0.47 % Removed by relevancy pruning/SinE : 137
% 0.10/0.47 % Initial clauses : 70
% 0.10/0.47 % Removed in clause preprocessing : 0
% 0.10/0.47 % Initial clauses in saturation : 70
% 0.10/0.47 % Processed clauses : 211
% 0.10/0.47 % ...of these trivial : 3
% 0.10/0.47 % ...subsumed : 63
% 0.10/0.47 % ...remaining for further processing : 145
% 0.10/0.47 % Other redundant clauses eliminated : 13
% 0.10/0.47 % Clauses deleted for lack of memory : 0
% 0.10/0.47 % Backward-subsumed : 17
% 0.10/0.47 % Backward-rewritten : 3
% 0.10/0.47 % Generated clauses : 562
% 0.10/0.47 % ...of the previous two non-redundant : 402
% 0.10/0.47 % ...aggressively subsumed : 0
% 0.10/0.47 % Contextual simplify-reflections : 3
% 0.10/0.47 % Paramodulations : 542
% 0.10/0.47 % Factorizations : 0
% 0.10/0.47 % NegExts : 0
% 0.10/0.47 % Equation resolutions : 17
% 0.10/0.47 % Disequality decompositions : 0
% 0.10/0.47 % Total rewrite steps : 607
% 0.10/0.47 % ...of those cached : 589
% 0.10/0.47 % Propositional unsat checks : 0
% 0.10/0.47 % Propositional check models : 0
% 0.10/0.47 % Propositional check unsatisfiable : 0
% 0.10/0.47 % Propositional clauses : 0
% 0.10/0.47 % Propositional clauses after purity: 0
% 0.10/0.47 % Propositional unsat core size : 0
% 0.10/0.47 % Propositional preprocessing time : 0.000
% 0.10/0.47 % Propositional encoding time : 0.000
% 0.10/0.47 % Propositional solver time : 0.000
% 0.10/0.47 % Success case prop preproc time : 0.000
% 0.10/0.47 % Success case prop encoding time : 0.000
% 0.10/0.47 % Success case prop solver time : 0.000
% 0.10/0.47 % Current number of processed clauses : 113
% 0.10/0.47 % Positive orientable unit clauses : 21
% 0.10/0.47 % Positive unorientable unit clauses: 0
% 0.10/0.47 % Negative unit clauses : 6
% 0.10/0.47 % Non-unit-clauses : 86
% 0.10/0.47 % Current number of unprocessed clauses: 234
% 0.10/0.47 % ...number of literals in the above : 1121
% 0.10/0.47 % Current number of archived formulas : 0
% 0.10/0.47 % Current number of archived clauses : 24
% 0.10/0.47 % Clause-clause subsumption calls (NU) : 1684
% 0.10/0.47 % Rec. Clause-clause subsumption calls : 609
% 0.10/0.47 % Non-unit clause-clause subsumptions : 63
% 0.10/0.47 % Unit Clause-clause subsumption calls : 185
% 0.10/0.47 % Rewrite failures with RHS unbound : 0
% 0.10/0.47 % BW rewrite match attempts : 7
% 0.10/0.47 % BW rewrite match successes : 7
% 0.10/0.47 % Condensation attempts : 0
% 0.10/0.47 % Condensation successes : 0
% 0.10/0.47 % Termbank termtop insertions : 13211
% 0.10/0.47 % Search garbage collected termcells : 900
% 0.10/0.47
% 0.10/0.47 % -------------------------------------------------
% 0.10/0.47 % User time : 0.012 s
% 0.10/0.47 % System time : 0.005 s
% 0.10/0.47 % Total time : 0.018 s
% 0.10/0.47 % Maximum resident set size: 4072 pages
% 0.10/0.47
% 0.10/0.47 % -------------------------------------------------
% 0.10/0.47 % User time : 0.018 s
% 0.10/0.47 % System time : 0.009 s
% 0.10/0.47 % Total time : 0.027 s
% 0.10/0.47 % Maximum resident set size: 4864 pages
% 0.10/0.47 % E exiting
%------------------------------------------------------------------------------