%------------------------------------------------------------------------------
% File : E---3.5.1
% Problem : SWC018-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 : n019.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:38 PM UTC 2026
% Result : Unsatisfiable 0.18s 5.51s
% Output : CNFRefutation 0.18s
% Verified :
% SZS Type : Refutation
% Derivation depth : 11
% Number of leaves : 18
% Syntax : Number of clauses : 61 ( 18 unt; 3 nHn; 61 RR)
% Number of literals : 159 ( 52 equ; 100 neg)
% Maximal clause size : 5 ( 2 avg)
% Maximal term depth : 2 ( 1 avg)
% Number of predicates : 5 ( 3 usr; 1 prp; 0-2 aty)
% Number of functors : 7 ( 7 usr; 6 con; 0-2 aty)
% Number of variables : 52 ( 0 sgn)
% Comments :
%------------------------------------------------------------------------------
cnf(clause119,axiom,
( ~ ssList(X1)
| ~ ssList(X2)
| app(X1,X2) != nil
| nil = X2 ),
file('/export/starexec/sandbox2/benchmark/Axioms/SWC001-0.ax',clause119) ).
cnf(co1_8,negated_conjecture,
app(sk3,sk5) = sk4,
file('/export/starexec/sandbox2/benchmark/theBenchmark.p',co1_8) ).
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_7,negated_conjecture,
ssList(sk5),
file('/export/starexec/sandbox2/benchmark/theBenchmark.p',co1_7) ).
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(clause144,axiom,
( ~ ssList(X3)
| ~ ssList(X1)
| ~ ssList(X2)
| app(X1,X2) != X3
| frontsegP(X3,X1) ),
file('/export/starexec/sandbox2/benchmark/Axioms/SWC001-0.ax',clause144) ).
cnf(clause85,axiom,
( ~ ssList(X2)
| ~ ssList(X1)
| ssList(app(X2,X1)) ),
file('/export/starexec/sandbox2/benchmark/Axioms/SWC001-0.ax',clause85) ).
cnf(co1_15,negated_conjecture,
( ~ frontsegP(sk1,X1)
| ~ frontsegP(sk2,X1)
| ~ neq(X1,nil)
| ~ ssList(X1)
| nil != sk1 ),
file('/export/starexec/sandbox2/benchmark/theBenchmark.p',co1_15) ).
cnf(co1_14,negated_conjecture,
( nil != sk1
| neq(sk2,nil) ),
file('/export/starexec/sandbox2/benchmark/theBenchmark.p',co1_14) ).
cnf(co1_2,negated_conjecture,
ssList(sk2),
file('/export/starexec/sandbox2/benchmark/theBenchmark.p',co1_2) ).
cnf(clause137,axiom,
( ~ ssList(X1)
| ~ ssList(X2)
| ~ ssList(X3)
| ~ frontsegP(X1,X2)
| frontsegP(app(X1,X3),X2) ),
file('/export/starexec/sandbox2/benchmark/Axioms/SWC001-0.ax',clause137) ).
cnf(co1_13,negated_conjecture,
( ~ frontsegP(sk1,X1)
| ~ frontsegP(sk2,X1)
| ~ neq(X1,nil)
| ~ ssList(X1)
| nil = sk2 ),
file('/export/starexec/sandbox2/benchmark/theBenchmark.p',co1_13) ).
cnf(clause100,axiom,
( ~ ssList(X2)
| ~ ssList(X1)
| X2 = X1
| neq(X2,X1) ),
file('/export/starexec/sandbox2/benchmark/Axioms/SWC001-0.ax',clause100) ).
cnf(co1_11,negated_conjecture,
( nil != sk3
| nil = sk4 ),
file('/export/starexec/sandbox2/benchmark/theBenchmark.p',co1_11) ).
cnf(clause8,axiom,
ssList(nil),
file('/export/starexec/sandbox2/benchmark/Axioms/SWC001-0.ax',clause8) ).
cnf(clause61,axiom,
( ~ ssList(X1)
| frontsegP(X1,X1) ),
file('/export/starexec/sandbox2/benchmark/Axioms/SWC001-0.ax',clause61) ).
cnf(c_0_18,plain,
( ~ ssList(X1)
| ~ ssList(X2)
| app(X1,X2) != nil
| nil = X2 ),
inference(fof_simplification,[status(thm)],[clause119]) ).
cnf(c_0_19,negated_conjecture,
app(sk3,sk5) = sk4,
co1_8 ).
cnf(c_0_20,negated_conjecture,
sk1 = sk3,
co1_6 ).
cnf(c_0_21,negated_conjecture,
sk2 = sk4,
co1_5 ).
cnf(c_0_22,plain,
( ~ ssList(X1)
| ~ ssList(X2)
| app(X1,X2) != nil
| nil = X2 ),
c_0_18 ).
cnf(c_0_23,negated_conjecture,
app(sk1,sk5) = sk2,
inference(rw,[status(thm)],[inference(rw,[status(thm)],[c_0_19,c_0_20]),c_0_21]) ).
cnf(c_0_24,negated_conjecture,
ssList(sk5),
co1_7 ).
cnf(c_0_25,negated_conjecture,
ssList(sk1),
co1_1 ).
cnf(c_0_26,plain,
( ~ ssList(X1)
| app(X1,nil) = X1 ),
inference(fof_simplification,[status(thm)],[clause73]) ).
cnf(c_0_27,negated_conjecture,
( sk2 != nil
| sk5 = nil ),
inference(cn,[status(thm)],[inference(rw,[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_28,plain,
( ~ ssList(X3)
| ~ ssList(X1)
| ~ ssList(X2)
| app(X1,X2) != X3
| frontsegP(X3,X1) ),
inference(fof_simplification,[status(thm)],[clause144]) ).
cnf(c_0_29,plain,
( ~ ssList(X2)
| ~ ssList(X1)
| ssList(app(X2,X1)) ),
inference(fof_simplification,[status(thm)],[clause85]) ).
cnf(c_0_30,plain,
( ~ ssList(X1)
| app(X1,nil) = X1 ),
c_0_26 ).
cnf(c_0_31,negated_conjecture,
( sk2 != nil
| app(sk1,nil) = sk2 ),
inference(spm,[status(thm)],[c_0_23,c_0_27]) ).
cnf(c_0_32,negated_conjecture,
( ~ frontsegP(sk1,X1)
| ~ frontsegP(sk2,X1)
| ~ neq(X1,nil)
| ~ ssList(X1)
| nil != sk1 ),
inference(fof_simplification,[status(thm)],[co1_15]) ).
cnf(c_0_33,negated_conjecture,
( nil != sk1
| neq(sk2,nil) ),
inference(fof_simplification,[status(thm)],[co1_14]) ).
cnf(c_0_34,plain,
( ~ ssList(X3)
| ~ ssList(X1)
| ~ ssList(X2)
| app(X1,X2) != X3
| frontsegP(X3,X1) ),
c_0_28 ).
cnf(c_0_35,plain,
( ~ ssList(X2)
| ~ ssList(X1)
| ssList(app(X2,X1)) ),
c_0_29 ).
cnf(c_0_36,negated_conjecture,
( sk2 != nil
| sk1 = sk2 ),
inference(cn,[status(thm)],[inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_30,c_0_31]),c_0_25])]) ).
cnf(c_0_37,negated_conjecture,
( ~ frontsegP(sk1,X1)
| ~ frontsegP(sk2,X1)
| ~ neq(X1,nil)
| ~ ssList(X1)
| nil != sk1 ),
c_0_32 ).
cnf(c_0_38,negated_conjecture,
( nil != sk1
| neq(sk2,nil) ),
c_0_33 ).
cnf(c_0_39,negated_conjecture,
ssList(sk2),
co1_2 ).
cnf(c_0_40,plain,
( ~ ssList(X1)
| ~ ssList(X2)
| frontsegP(app(X1,X2),X1) ),
inference(csr,[status(thm)],[inference(er,[status(thm)],[c_0_34]),c_0_35]) ).
cnf(c_0_41,negated_conjecture,
( sk2 != nil
| app(sk2,sk5) = sk2 ),
inference(spm,[status(thm)],[c_0_23,c_0_36]) ).
cnf(c_0_42,plain,
( ~ ssList(X1)
| ~ ssList(X2)
| ~ ssList(X3)
| ~ frontsegP(X1,X2)
| frontsegP(app(X1,X3),X2) ),
inference(fof_simplification,[status(thm)],[clause137]) ).
cnf(c_0_43,negated_conjecture,
( ~ frontsegP(sk1,X1)
| ~ frontsegP(sk2,X1)
| ~ neq(X1,nil)
| ~ ssList(X1)
| nil = sk2 ),
inference(fof_simplification,[status(thm)],[co1_13]) ).
cnf(c_0_44,plain,
( ~ ssList(X2)
| ~ ssList(X1)
| X2 = X1
| neq(X2,X1) ),
inference(fof_simplification,[status(thm)],[clause100]) ).
cnf(c_0_45,negated_conjecture,
( ~ frontsegP(sk2,sk2)
| ~ frontsegP(sk1,sk2)
| sk1 != nil ),
inference(cn,[status(thm)],[inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_37,c_0_38]),c_0_39])]) ).
cnf(c_0_46,negated_conjecture,
( sk2 != nil
| frontsegP(sk2,sk2) ),
inference(cn,[status(thm)],[inference(rw,[status(thm)],[inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_40,c_0_41]),c_0_24]),c_0_39])]) ).
cnf(c_0_47,plain,
( ~ ssList(X1)
| ~ ssList(X2)
| ~ ssList(X3)
| ~ frontsegP(X1,X2)
| frontsegP(app(X1,X3),X2) ),
c_0_42 ).
cnf(c_0_48,negated_conjecture,
( nil != sk3
| nil = sk4 ),
inference(fof_simplification,[status(thm)],[co1_11]) ).
cnf(c_0_49,negated_conjecture,
( ~ frontsegP(sk1,X1)
| ~ frontsegP(sk2,X1)
| ~ neq(X1,nil)
| ~ ssList(X1)
| nil = sk2 ),
c_0_43 ).
cnf(c_0_50,plain,
( ~ ssList(X2)
| ~ ssList(X1)
| X2 = X1
| neq(X2,X1) ),
c_0_44 ).
cnf(c_0_51,axiom,
ssList(nil),
clause8 ).
cnf(c_0_52,negated_conjecture,
sk2 != nil,
inference(csr,[status(thm)],[inference(spm,[status(thm)],[c_0_45,c_0_36]),c_0_46]) ).
cnf(c_0_53,negated_conjecture,
( ~ ssList(X1)
| ~ frontsegP(sk1,X1)
| frontsegP(sk2,X1) ),
inference(cn,[status(thm)],[inference(rw,[status(thm)],[inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_47,c_0_23]),c_0_24]),c_0_25])]) ).
cnf(c_0_54,plain,
( ~ ssList(X1)
| frontsegP(X1,X1) ),
inference(fof_simplification,[status(thm)],[clause61]) ).
cnf(c_0_55,negated_conjecture,
( nil != sk3
| nil = sk4 ),
c_0_48 ).
cnf(c_0_56,negated_conjecture,
( ~ ssList(X1)
| ~ frontsegP(sk1,X1)
| nil = X1 ),
inference(csr,[status(thm)],[inference(sr,[status(thm)],[inference(cn,[status(thm)],[inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_49,c_0_50]),c_0_51])]),c_0_52]),c_0_53]) ).
cnf(c_0_57,plain,
( ~ ssList(X1)
| frontsegP(X1,X1) ),
c_0_54 ).
cnf(c_0_58,negated_conjecture,
( sk1 != nil
| sk2 = nil ),
inference(rw,[status(thm)],[inference(rw,[status(thm)],[c_0_55,c_0_21]),c_0_20]) ).
cnf(c_0_59,negated_conjecture,
sk1 = nil,
inference(cn,[status(thm)],[inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_56,c_0_57]),c_0_25])]) ).
cnf(c_0_60,negated_conjecture,
$false,
inference(sr,[status(thm)],[inference(cn,[status(thm)],[inference(rw,[status(thm)],[c_0_58,c_0_59])]),c_0_52]),
[proof] ).
%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.00/0.02 % Problem : SWC018-1 : TPTP v9.3.1. Released v2.4.0.
% 0.00/0.04 % Command : run_E /export/starexec/sandbox2/benchmark/theBenchmark.p 300 THM
% 0.14/5.39 % Computer : n019.cluster.edu
% 0.14/5.39 % Model : x86_64 x86_64
% 0.14/5.39 % CPU : Intel(R) Xeon(R) CPU E5-2620 v4 @ 2.10GHz
% 0.14/5.39 % Memory : 8046.5625MB
% 0.14/5.39 % OS : Linux 6.8.0-71-generic
% 0.14/5.39 % CPULimit : 300
% 0.14/5.39 % WCLimit : 300
% 0.14/5.39 % DateTime : Mon Sep 21 07:49:42 UTC 2026
% 0.18/5.40 % CPUTime :
% 0.18/5.40 Running run_E /export/starexec/sandbox2/benchmark/theBenchmark.p 300 THM
% 0.18/5.46 Running first-order theorem proving
% 0.18/5.46 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.18/5.51 % Version: 3.5.1
% 0.18/5.51 % Preprocessing class: FSLSSMSMSSSNFFN.
% 0.18/5.51 % Scheduled 4 strats onto 8 cores with 300 seconds (2400 total)
% 0.18/5.51 % Starting C07_19_nc_SOS_SAT001_MinMin_p005000_rr with 1500s (5) cores
% 0.18/5.51 % Starting new_bool_3 with 300s (1) cores
% 0.18/5.51 % Starting new_bool_1 with 300s (1) cores
% 0.18/5.51 % Starting sh5l with 300s (1) cores
% 0.18/5.51 % new_bool_1 with pid 2068036 completed with status 0
% 0.18/5.51 % Result found by new_bool_1
% 0.18/5.51 % Preprocessing class: FSLSSMSMSSSNFFN.
% 0.18/5.51 % Scheduled 4 strats onto 8 cores with 300 seconds (2400 total)
% 0.18/5.51 % Starting C07_19_nc_SOS_SAT001_MinMin_p005000_rr with 1500s (5) cores
% 0.18/5.51 % Starting new_bool_3 with 300s (1) cores
% 0.18/5.51 % Starting new_bool_1 with 300s (1) cores
% 0.18/5.51 % (lift_lambdas = 0, lambda_to_forall = 0,unroll_only_formulas = 0, sine = GSinE(CountFormulas,hypos,1.5,,3,20000,1.0))
% 0.18/5.51 % SinE strategy is GSinE(CountFormulas,hypos,1.5,,3,20000,1.0)
% 0.18/5.51 % Search class: FGHSF-FFMM22-MFFFFFNN
% 0.18/5.51 % partial match(1): FGHSF-FFMM21-MFFFFFNN
% 0.18/5.51 % Scheduled 5 strats onto 1 cores with 300 seconds (300 total)
% 0.18/5.51 % Starting SubtermCWHack with 31s (1) cores
% 0.18/5.51 % SubtermCWHack with pid 2068039 completed with status 0
% 0.18/5.51 % Result found by SubtermCWHack
% 0.18/5.51 % Preprocessing class: FSLSSMSMSSSNFFN.
% 0.18/5.51 % Scheduled 4 strats onto 8 cores with 300 seconds (2400 total)
% 0.18/5.51 % Starting C07_19_nc_SOS_SAT001_MinMin_p005000_rr with 1500s (5) cores
% 0.18/5.51 % Starting new_bool_3 with 300s (1) cores
% 0.18/5.51 % Starting new_bool_1 with 300s (1) cores
% 0.18/5.51 % (lift_lambdas = 0, lambda_to_forall = 0,unroll_only_formulas = 0, sine = GSinE(CountFormulas,hypos,1.5,,3,20000,1.0))
% 0.18/5.51 % SinE strategy is GSinE(CountFormulas,hypos,1.5,,3,20000,1.0)
% 0.18/5.51 % Search class: FGHSF-FFMM22-MFFFFFNN
% 0.18/5.51 % partial match(1): FGHSF-FFMM21-MFFFFFNN
% 0.18/5.51 % Scheduled 5 strats onto 1 cores with 300 seconds (300 total)
% 0.18/5.51 % Starting SubtermCWHack with 31s (1) cores
% 0.18/5.51 % Preprocessing time : 0.002 s
% 0.18/5.51
% 0.18/5.51 % Proof found!
% 0.18/5.51 % SZS status Unsatisfiable
% 0.18/5.51 % SZS output start CNFRefutation
% See solution above
% 0.18/5.51 % Parsed axioms : 200
% 0.18/5.51 % Removed by relevancy pruning/SinE : 150
% 0.18/5.51 % Initial clauses : 50
% 0.18/5.51 % Removed in clause preprocessing : 0
% 0.18/5.51 % Initial clauses in saturation : 50
% 0.18/5.51 % Processed clauses : 237
% 0.18/5.51 % ...of these trivial : 11
% 0.18/5.51 % ...subsumed : 90
% 0.18/5.51 % ...remaining for further processing : 136
% 0.18/5.51 % Other redundant clauses eliminated : 13
% 0.18/5.51 % Clauses deleted for lack of memory : 0
% 0.18/5.51 % Backward-subsumed : 24
% 0.18/5.51 % Backward-rewritten : 28
% 0.18/5.51 % Generated clauses : 570
% 0.18/5.51 % ...of the previous two non-redundant : 452
% 0.18/5.51 % ...aggressively subsumed : 0
% 0.18/5.51 % Contextual simplify-reflections : 3
% 0.18/5.51 % Paramodulations : 553
% 0.18/5.51 % Factorizations : 0
% 0.18/5.51 % NegExts : 0
% 0.18/5.51 % Equation resolutions : 17
% 0.18/5.51 % Disequality decompositions : 0
% 0.18/5.51 % Total rewrite steps : 611
% 0.18/5.51 % ...of those cached : 594
% 0.18/5.51 % Propositional unsat checks : 0
% 0.18/5.51 % Propositional check models : 0
% 0.18/5.51 % Propositional check unsatisfiable : 0
% 0.18/5.51 % Propositional clauses : 0
% 0.18/5.51 % Propositional clauses after purity: 0
% 0.18/5.51 % Propositional unsat core size : 0
% 0.18/5.51 % Propositional preprocessing time : 0.000
% 0.18/5.51 % Propositional encoding time : 0.000
% 0.18/5.51 % Propositional solver time : 0.000
% 0.18/5.51 % Success case prop preproc time : 0.000
% 0.18/5.51 % Success case prop encoding time : 0.000
% 0.18/5.51 % Success case prop solver time : 0.000
% 0.18/5.51 % Current number of processed clauses : 76
% 0.18/5.51 % Positive orientable unit clauses : 13
% 0.18/5.51 % Positive unorientable unit clauses: 0
% 0.18/5.51 % Negative unit clauses : 3
% 0.18/5.51 % Non-unit-clauses : 60
% 0.18/5.51 % Current number of unprocessed clauses: 209
% 0.18/5.51 % ...number of literals in the above : 1033
% 0.18/5.51 % Current number of archived formulas : 0
% 0.18/5.51 % Current number of archived clauses : 53
% 0.18/5.51 % Clause-clause subsumption calls (NU) : 1420
% 0.18/5.51 % Rec. Clause-clause subsumption calls : 848
% 0.18/5.51 % Non-unit clause-clause subsumptions : 87
% 0.18/5.51 % Unit Clause-clause subsumption calls : 120
% 0.18/5.51 % Rewrite failures with RHS unbound : 0
% 0.18/5.51 % BW rewrite match attempts : 5
% 0.18/5.51 % BW rewrite match successes : 5
% 0.18/5.51 % Condensation attempts : 0
% 0.18/5.51 % Condensation successes : 0
% 0.18/5.51 % Termbank termtop insertions : 12024
% 0.18/5.51 % Search garbage collected termcells : 923
% 0.18/5.51
% 0.18/5.51 % -------------------------------------------------
% 0.18/5.51 % User time : 0.017 s
% 0.18/5.51 % System time : 0.004 s
% 0.18/5.51 % Total time : 0.021 s
% 0.18/5.51 % Maximum resident set size: 3812 pages
% 0.18/5.51
% 0.18/5.51 % -------------------------------------------------
% 0.18/5.51 % User time : 0.026 s
% 0.18/5.51 % System time : 0.009 s
% 0.18/5.51 % Total time : 0.035 s
% 0.18/5.51 % Maximum resident set size: 5120 pages
% 0.18/5.51 % E exiting
%------------------------------------------------------------------------------