%------------------------------------------------------------------------------
% File : E---3.5.1
% Problem : SWC384-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 : n011.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:11 PM UTC 2026
% Result : Unsatisfiable 0.29s 0.64s
% Output : CNFRefutation 0.29s
% Verified :
% SZS Type : Refutation
% Derivation depth : 10
% Number of leaves : 18
% Syntax : Number of clauses : 59 ( 21 unt; 14 nHn; 59 RR)
% Number of literals : 126 ( 39 equ; 67 neg)
% Maximal clause size : 6 ( 2 avg)
% Maximal term depth : 3 ( 1 avg)
% Number of predicates : 7 ( 5 usr; 1 prp; 0-2 aty)
% Number of functors : 10 ( 10 usr; 8 con; 0-2 aty)
% Number of variables : 36 ( 0 sgn)
% Comments :
%------------------------------------------------------------------------------
cnf(clause98,axiom,
( ~ ssList(X2)
| ~ ssItem(X1)
| cons(X1,X2) != nil ),
file('/export/starexec/sandbox2/benchmark/Axioms/SWC001-0.ax',clause98) ).
cnf(clause115,axiom,
( ~ ssList(X1)
| ~ ssList(X2)
| ~ neq(X1,X2)
| X1 != X2 ),
file('/export/starexec/sandbox2/benchmark/Axioms/SWC001-0.ax',clause115) ).
cnf(co1_7,negated_conjecture,
neq(sk2,nil),
file('/export/starexec/sandbox2/benchmark/theBenchmark.p',co1_7) ).
cnf(co1_5,negated_conjecture,
sk2 = sk4,
file('/export/starexec/sandbox2/benchmark/theBenchmark.p',co1_5) ).
cnf(co1_12,negated_conjecture,
( nil = sk4
| cons(sk5,nil) = sk3 ),
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_8,negated_conjecture,
( nil = sk4
| ssItem(sk5) ),
file('/export/starexec/sandbox2/benchmark/theBenchmark.p',co1_8) ).
cnf(clause116,axiom,
( ~ ssList(X2)
| ~ ssItem(X1)
| cons(X1,nil) != X2
| singletonP(X2) ),
file('/export/starexec/sandbox2/benchmark/Axioms/SWC001-0.ax',clause116) ).
cnf(co1_22,negated_conjecture,
( ~ segmentP(sk2,sk1)
| ~ singletonP(sk1) ),
file('/export/starexec/sandbox2/benchmark/theBenchmark.p',co1_22) ).
cnf(co1_18,negated_conjecture,
( nil = sk3
| cons(sk5,nil) = sk3 ),
file('/export/starexec/sandbox2/benchmark/theBenchmark.p',co1_18) ).
cnf(co1_9,negated_conjecture,
( nil = sk3
| ssItem(sk5) ),
file('/export/starexec/sandbox2/benchmark/theBenchmark.p',co1_9) ).
cnf(co1_6,negated_conjecture,
sk1 = sk3,
file('/export/starexec/sandbox2/benchmark/theBenchmark.p',co1_6) ).
cnf(co1_3,negated_conjecture,
ssList(sk3),
file('/export/starexec/sandbox2/benchmark/theBenchmark.p',co1_3) ).
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_19,negated_conjecture,
( nil = sk3
| app(app(sk6,sk3),sk7) = sk4 ),
file('/export/starexec/sandbox2/benchmark/theBenchmark.p',co1_19) ).
cnf(co1_16,negated_conjecture,
( nil = sk3
| ssList(sk6) ),
file('/export/starexec/sandbox2/benchmark/theBenchmark.p',co1_16) ).
cnf(co1_17,negated_conjecture,
( nil = sk3
| ssList(sk7) ),
file('/export/starexec/sandbox2/benchmark/theBenchmark.p',co1_17) ).
cnf(clause57,axiom,
( ~ ssList(X1)
| segmentP(X1,X1) ),
file('/export/starexec/sandbox2/benchmark/Axioms/SWC001-0.ax',clause57) ).
cnf(c_0_18,plain,
( ~ ssList(X2)
| ~ ssItem(X1)
| cons(X1,X2) != nil ),
inference(fof_simplification,[status(thm)],[clause98]) ).
cnf(c_0_19,plain,
( ~ ssList(X1)
| ~ ssList(X2)
| ~ neq(X1,X2)
| X1 != X2 ),
inference(fof_simplification,[status(thm)],[clause115]) ).
cnf(c_0_20,negated_conjecture,
neq(sk2,nil),
co1_7 ).
cnf(c_0_21,negated_conjecture,
sk2 = sk4,
co1_5 ).
cnf(c_0_22,plain,
( ~ ssList(X2)
| ~ ssItem(X1)
| cons(X1,X2) != nil ),
c_0_18 ).
cnf(c_0_23,negated_conjecture,
( nil = sk4
| cons(sk5,nil) = sk3 ),
co1_12 ).
cnf(c_0_24,axiom,
ssList(nil),
clause8 ).
cnf(c_0_25,negated_conjecture,
( nil = sk4
| ssItem(sk5) ),
co1_8 ).
cnf(c_0_26,plain,
( ~ ssList(X1)
| ~ ssList(X2)
| ~ neq(X1,X2)
| X1 != X2 ),
c_0_19 ).
cnf(c_0_27,negated_conjecture,
neq(sk4,nil),
inference(rw,[status(thm)],[c_0_20,c_0_21]) ).
cnf(c_0_28,negated_conjecture,
( sk3 != nil
| sk4 = nil ),
inference(csr,[status(thm)],[inference(cn,[status(thm)],[inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_22,c_0_23]),c_0_24])]),c_0_25]) ).
cnf(c_0_29,plain,
( ~ ssList(X2)
| ~ ssItem(X1)
| cons(X1,nil) != X2
| singletonP(X2) ),
inference(fof_simplification,[status(thm)],[clause116]) ).
cnf(c_0_30,plain,
( ~ ssList(X1)
| ~ neq(X1,X1) ),
inference(er,[status(thm)],[c_0_26]) ).
cnf(c_0_31,negated_conjecture,
( sk3 != nil
| neq(nil,nil) ),
inference(spm,[status(thm)],[c_0_27,c_0_28]) ).
cnf(c_0_32,negated_conjecture,
( ~ segmentP(sk2,sk1)
| ~ singletonP(sk1) ),
inference(fof_simplification,[status(thm)],[co1_22]) ).
cnf(c_0_33,plain,
( ~ ssList(X2)
| ~ ssItem(X1)
| cons(X1,nil) != X2
| singletonP(X2) ),
c_0_29 ).
cnf(c_0_34,negated_conjecture,
( nil = sk3
| cons(sk5,nil) = sk3 ),
co1_18 ).
cnf(c_0_35,negated_conjecture,
sk3 != nil,
inference(cn,[status(thm)],[inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_30,c_0_31]),c_0_24])]) ).
cnf(c_0_36,negated_conjecture,
( nil = sk3
| ssItem(sk5) ),
co1_9 ).
cnf(c_0_37,negated_conjecture,
( ~ segmentP(sk2,sk1)
| ~ singletonP(sk1) ),
c_0_32 ).
cnf(c_0_38,negated_conjecture,
sk1 = sk3,
co1_6 ).
cnf(c_0_39,plain,
( ~ ssList(cons(X1,nil))
| ~ ssItem(X1)
| singletonP(cons(X1,nil)) ),
inference(er,[status(thm)],[c_0_33]) ).
cnf(c_0_40,negated_conjecture,
cons(sk5,nil) = sk3,
inference(sr,[status(thm)],[c_0_34,c_0_35]) ).
cnf(c_0_41,negated_conjecture,
ssItem(sk5),
inference(sr,[status(thm)],[c_0_36,c_0_35]) ).
cnf(c_0_42,negated_conjecture,
ssList(sk3),
co1_3 ).
cnf(c_0_43,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_44,negated_conjecture,
( nil = sk3
| app(app(sk6,sk3),sk7) = sk4 ),
co1_19 ).
cnf(c_0_45,negated_conjecture,
( nil = sk3
| ssList(sk6) ),
co1_16 ).
cnf(c_0_46,negated_conjecture,
( nil = sk3
| ssList(sk7) ),
co1_17 ).
cnf(c_0_47,negated_conjecture,
( ~ singletonP(sk3)
| ~ segmentP(sk4,sk3) ),
inference(rw,[status(thm)],[inference(rw,[status(thm)],[inference(rw,[status(thm)],[c_0_37,c_0_38]),c_0_21]),c_0_38]) ).
cnf(c_0_48,negated_conjecture,
singletonP(sk3),
inference(cn,[status(thm)],[inference(rw,[status(thm)],[inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_39,c_0_40]),c_0_41]),c_0_42])]) ).
cnf(c_0_49,plain,
( ~ ssList(X1)
| ~ ssList(X2)
| ~ ssList(X4)
| ~ ssList(X3)
| ~ segmentP(X1,X2)
| segmentP(app(app(X4,X1),X3),X2) ),
c_0_43 ).
cnf(c_0_50,negated_conjecture,
app(app(sk6,sk3),sk7) = sk4,
inference(sr,[status(thm)],[c_0_44,c_0_35]) ).
cnf(c_0_51,negated_conjecture,
ssList(sk6),
inference(sr,[status(thm)],[c_0_45,c_0_35]) ).
cnf(c_0_52,negated_conjecture,
ssList(sk7),
inference(sr,[status(thm)],[c_0_46,c_0_35]) ).
cnf(c_0_53,negated_conjecture,
~ segmentP(sk4,sk3),
inference(cn,[status(thm)],[inference(rw,[status(thm)],[c_0_47,c_0_48])]) ).
cnf(c_0_54,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_49,c_0_50]),c_0_51]),c_0_52]),c_0_42])]) ).
cnf(c_0_55,plain,
( ~ ssList(X1)
| segmentP(X1,X1) ),
inference(fof_simplification,[status(thm)],[clause57]) ).
cnf(c_0_56,negated_conjecture,
~ segmentP(sk3,sk3),
inference(cn,[status(thm)],[inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_53,c_0_54]),c_0_42])]) ).
cnf(c_0_57,plain,
( ~ ssList(X1)
| segmentP(X1,X1) ),
c_0_55 ).
cnf(c_0_58,negated_conjecture,
$false,
inference(cn,[status(thm)],[inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_56,c_0_57]),c_0_42])]),
[proof] ).
%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.00/0.05 % Problem : SWC384-1 : TPTP v9.3.1. Released v2.4.0.
% 0.00/0.07 % Command : run_E /export/starexec/sandbox2/benchmark/theBenchmark.p 300 THM
% 0.16/0.47 % Computer : n011.cluster.edu
% 0.16/0.47 % Model : x86_64 x86_64
% 0.16/0.47 % CPU : Intel(R) Xeon(R) CPU E5-2620 v4 @ 2.10GHz
% 0.16/0.47 % Memory : 8046.5625MB
% 0.16/0.47 % OS : Linux 6.8.0-71-generic
% 0.16/0.47 % CPULimit : 300
% 0.16/0.48 % WCLimit : 300
% 0.16/0.48 % DateTime : Mon Sep 21 08:20:27 UTC 2026
% 0.16/0.48 % CPUTime :
% 0.16/0.48 Running run_E /export/starexec/sandbox2/benchmark/theBenchmark.p 300 THM
% 0.22/0.55 Running first-order theorem proving
% 0.22/0.55 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.29/0.64 % Version: 3.5.1
% 0.29/0.64 % Preprocessing class: FSLSSMSMSSSNFFN.
% 0.29/0.64 % Scheduled 4 strats onto 8 cores with 300 seconds (2400 total)
% 0.29/0.64 % Starting C07_19_nc_SOS_SAT001_MinMin_p005000_rr with 1500s (5) cores
% 0.29/0.64 % Starting new_bool_3 with 300s (1) cores
% 0.29/0.64 % Starting new_bool_1 with 300s (1) cores
% 0.29/0.64 % Starting sh5l with 300s (1) cores
% 0.29/0.64 % new_bool_1 with pid 1443608 completed with status 0
% 0.29/0.64 % Result found by new_bool_1
% 0.29/0.64 % Preprocessing class: FSLSSMSMSSSNFFN.
% 0.29/0.64 % Scheduled 4 strats onto 8 cores with 300 seconds (2400 total)
% 0.29/0.64 % Starting C07_19_nc_SOS_SAT001_MinMin_p005000_rr with 1500s (5) cores
% 0.29/0.64 % Starting new_bool_3 with 300s (1) cores
% 0.29/0.64 % Starting new_bool_1 with 300s (1) cores
% 0.29/0.64 % (lift_lambdas = 0, lambda_to_forall = 0,unroll_only_formulas = 0, sine = GSinE(CountFormulas,hypos,1.5,,3,20000,1.0))
% 0.29/0.64 % SinE strategy is GSinE(CountFormulas,hypos,1.5,,3,20000,1.0)
% 0.29/0.64 % Search class: FGHSF-FFMM22-SFFFFFNN
% 0.29/0.64 % Scheduled 5 strats onto 1 cores with 300 seconds (300 total)
% 0.29/0.64 % Starting SubtermCWHack with 31s (1) cores
% 0.29/0.64 % SubtermCWHack with pid 1443611 completed with status 0
% 0.29/0.64 % Result found by SubtermCWHack
% 0.29/0.64 % Preprocessing class: FSLSSMSMSSSNFFN.
% 0.29/0.64 % Scheduled 4 strats onto 8 cores with 300 seconds (2400 total)
% 0.29/0.64 % Starting C07_19_nc_SOS_SAT001_MinMin_p005000_rr with 1500s (5) cores
% 0.29/0.64 % Starting new_bool_3 with 300s (1) cores
% 0.29/0.64 % Starting new_bool_1 with 300s (1) cores
% 0.29/0.64 % (lift_lambdas = 0, lambda_to_forall = 0,unroll_only_formulas = 0, sine = GSinE(CountFormulas,hypos,1.5,,3,20000,1.0))
% 0.29/0.64 % SinE strategy is GSinE(CountFormulas,hypos,1.5,,3,20000,1.0)
% 0.29/0.64 % Search class: FGHSF-FFMM22-SFFFFFNN
% 0.29/0.64 % Scheduled 5 strats onto 1 cores with 300 seconds (300 total)
% 0.29/0.64 % Starting SubtermCWHack with 31s (1) cores
% 0.29/0.64 % Preprocessing time : 0.003 s
% 0.29/0.64
% 0.29/0.64 % Proof found!
% 0.29/0.64 % SZS status Unsatisfiable
% 0.29/0.64 % SZS output start CNFRefutation
% See solution above
% 0.29/0.64 % Parsed axioms : 207
% 0.29/0.64 % Removed by relevancy pruning/SinE : 135
% 0.29/0.64 % Initial clauses : 72
% 0.29/0.64 % Removed in clause preprocessing : 0
% 0.29/0.64 % Initial clauses in saturation : 72
% 0.29/0.64 % Processed clauses : 222
% 0.29/0.64 % ...of these trivial : 3
% 0.29/0.64 % ...subsumed : 65
% 0.29/0.64 % ...remaining for further processing : 154
% 0.29/0.64 % Other redundant clauses eliminated : 14
% 0.29/0.64 % Clauses deleted for lack of memory : 0
% 0.29/0.64 % Backward-subsumed : 19
% 0.29/0.64 % Backward-rewritten : 4
% 0.29/0.64 % Generated clauses : 575
% 0.29/0.64 % ...of the previous two non-redundant : 412
% 0.29/0.64 % ...aggressively subsumed : 0
% 0.29/0.64 % Contextual simplify-reflections : 2
% 0.29/0.64 % Paramodulations : 553
% 0.29/0.64 % Factorizations : 0
% 0.29/0.64 % NegExts : 0
% 0.29/0.64 % Equation resolutions : 18
% 0.29/0.64 % Disequality decompositions : 0
% 0.29/0.64 % Total rewrite steps : 627
% 0.29/0.64 % ...of those cached : 608
% 0.29/0.64 % Propositional unsat checks : 0
% 0.29/0.64 % Propositional check models : 0
% 0.29/0.64 % Propositional check unsatisfiable : 0
% 0.29/0.64 % Propositional clauses : 0
% 0.29/0.64 % Propositional clauses after purity: 0
% 0.29/0.64 % Propositional unsat core size : 0
% 0.29/0.64 % Propositional preprocessing time : 0.000
% 0.29/0.64 % Propositional encoding time : 0.000
% 0.29/0.64 % Propositional solver time : 0.000
% 0.29/0.64 % Success case prop preproc time : 0.000
% 0.29/0.64 % Success case prop encoding time : 0.000
% 0.29/0.64 % Success case prop solver time : 0.000
% 0.29/0.64 % Current number of processed clauses : 117
% 0.29/0.64 % Positive orientable unit clauses : 23
% 0.29/0.64 % Positive unorientable unit clauses: 0
% 0.29/0.64 % Negative unit clauses : 9
% 0.29/0.64 % Non-unit-clauses : 85
% 0.29/0.64 % Current number of unprocessed clauses: 234
% 0.29/0.64 % ...number of literals in the above : 1122
% 0.29/0.64 % Current number of archived formulas : 0
% 0.29/0.64 % Current number of archived clauses : 28
% 0.29/0.64 % Clause-clause subsumption calls (NU) : 1686
% 0.29/0.64 % Rec. Clause-clause subsumption calls : 615
% 0.29/0.64 % Non-unit clause-clause subsumptions : 63
% 0.29/0.64 % Unit Clause-clause subsumption calls : 205
% 0.29/0.64 % Rewrite failures with RHS unbound : 0
% 0.29/0.64 % BW rewrite match attempts : 9
% 0.29/0.64 % BW rewrite match successes : 9
% 0.29/0.64 % Condensation attempts : 0
% 0.29/0.64 % Condensation successes : 0
% 0.29/0.64 % Termbank termtop insertions : 13316
% 0.29/0.64 % Search garbage collected termcells : 890
% 0.29/0.64
% 0.29/0.64 % -------------------------------------------------
% 0.29/0.64 % User time : 0.030 s
% 0.29/0.64 % System time : 0.005 s
% 0.29/0.64 % Total time : 0.034 s
% 0.29/0.64 % Maximum resident set size: 4072 pages
% 0.29/0.64
% 0.29/0.64 % -------------------------------------------------
% 0.29/0.64 % User time : 0.037 s
% 0.29/0.64 % System time : 0.011 s
% 0.29/0.64 % Total time : 0.048 s
% 0.29/0.64 % Maximum resident set size: 4864 pages
% 0.29/0.64 % E exiting
%------------------------------------------------------------------------------