%------------------------------------------------------------------------------
% File : E---3.5.1
% Problem : SWC024-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:42:40 PM UTC 2026
% Result : Unsatisfiable 0.11s 0.45s
% Output : CNFRefutation 0.11s
% Verified :
% SZS Type : Refutation
% Derivation depth : 6
% Number of leaves : 14
% Syntax : Number of clauses : 45 ( 19 unt; 3 nHn; 45 RR)
% Number of literals : 106 ( 24 equ; 68 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 : 38 ( 0 sgn)
% Comments :
%------------------------------------------------------------------------------
cnf(co1_8,negated_conjecture,
( ~ frontsegP(sk1,X1)
| ~ frontsegP(sk2,X1)
| ~ neq(X1,nil)
| ~ ssList(X1) ),
file('/export/starexec/sandbox/benchmark/theBenchmark.p',co1_8) ).
cnf(clause144,axiom,
( ~ ssList(X3)
| ~ ssList(X1)
| ~ ssList(X2)
| app(X1,X2) != X3
| frontsegP(X3,X1) ),
file('/export/starexec/sandbox/benchmark/Axioms/SWC001-0.ax',clause144) ).
cnf(clause85,axiom,
( ~ ssList(X2)
| ~ ssList(X1)
| ssList(app(X2,X1)) ),
file('/export/starexec/sandbox/benchmark/Axioms/SWC001-0.ax',clause85) ).
cnf(clause115,axiom,
( ~ ssList(X1)
| ~ ssList(X2)
| ~ neq(X1,X2)
| X1 != X2 ),
file('/export/starexec/sandbox/benchmark/Axioms/SWC001-0.ax',clause115) ).
cnf(co1_7,negated_conjecture,
neq(sk2,nil),
file('/export/starexec/sandbox/benchmark/theBenchmark.p',co1_7) ).
cnf(co1_5,negated_conjecture,
sk2 = sk4,
file('/export/starexec/sandbox/benchmark/theBenchmark.p',co1_5) ).
cnf(co1_13,negated_conjecture,
( nil != sk3
| nil = sk4 ),
file('/export/starexec/sandbox/benchmark/theBenchmark.p',co1_13) ).
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(clause8,axiom,
ssList(nil),
file('/export/starexec/sandbox/benchmark/Axioms/SWC001-0.ax',clause8) ).
cnf(co1_10,negated_conjecture,
app(sk3,sk5) = sk4,
file('/export/starexec/sandbox/benchmark/theBenchmark.p',co1_10) ).
cnf(co1_9,negated_conjecture,
ssList(sk5),
file('/export/starexec/sandbox/benchmark/theBenchmark.p',co1_9) ).
cnf(co1_3,negated_conjecture,
ssList(sk3),
file('/export/starexec/sandbox/benchmark/theBenchmark.p',co1_3) ).
cnf(clause61,axiom,
( ~ ssList(X1)
| frontsegP(X1,X1) ),
file('/export/starexec/sandbox/benchmark/Axioms/SWC001-0.ax',clause61) ).
cnf(c_0_14,negated_conjecture,
( ~ frontsegP(sk1,X1)
| ~ frontsegP(sk2,X1)
| ~ neq(X1,nil)
| ~ ssList(X1) ),
inference(fof_simplification,[status(thm)],[co1_8]) ).
cnf(c_0_15,plain,
( ~ ssList(X3)
| ~ ssList(X1)
| ~ ssList(X2)
| app(X1,X2) != X3
| frontsegP(X3,X1) ),
inference(fof_simplification,[status(thm)],[clause144]) ).
cnf(c_0_16,plain,
( ~ ssList(X2)
| ~ ssList(X1)
| ssList(app(X2,X1)) ),
inference(fof_simplification,[status(thm)],[clause85]) ).
cnf(c_0_17,plain,
( ~ ssList(X1)
| ~ ssList(X2)
| ~ neq(X1,X2)
| X1 != X2 ),
inference(fof_simplification,[status(thm)],[clause115]) ).
cnf(c_0_18,negated_conjecture,
neq(sk2,nil),
co1_7 ).
cnf(c_0_19,negated_conjecture,
sk2 = sk4,
co1_5 ).
cnf(c_0_20,negated_conjecture,
( nil != sk3
| nil = sk4 ),
inference(fof_simplification,[status(thm)],[co1_13]) ).
cnf(c_0_21,negated_conjecture,
( ~ frontsegP(sk1,X1)
| ~ frontsegP(sk2,X1)
| ~ neq(X1,nil)
| ~ ssList(X1) ),
c_0_14 ).
cnf(c_0_22,negated_conjecture,
sk1 = sk3,
co1_6 ).
cnf(c_0_23,plain,
( ~ ssList(X2)
| ~ ssList(X1)
| X2 = X1
| neq(X2,X1) ),
inference(fof_simplification,[status(thm)],[clause100]) ).
cnf(c_0_24,plain,
( ~ ssList(X3)
| ~ ssList(X1)
| ~ ssList(X2)
| app(X1,X2) != X3
| frontsegP(X3,X1) ),
c_0_15 ).
cnf(c_0_25,plain,
( ~ ssList(X2)
| ~ ssList(X1)
| ssList(app(X2,X1)) ),
c_0_16 ).
cnf(c_0_26,plain,
( ~ ssList(X1)
| ~ ssList(X2)
| ~ neq(X1,X2)
| X1 != X2 ),
c_0_17 ).
cnf(c_0_27,negated_conjecture,
neq(sk4,nil),
inference(rw,[status(thm)],[c_0_18,c_0_19]) ).
cnf(c_0_28,negated_conjecture,
( nil != sk3
| nil = sk4 ),
c_0_20 ).
cnf(c_0_29,negated_conjecture,
( ~ ssList(X1)
| ~ frontsegP(sk4,X1)
| ~ frontsegP(sk3,X1)
| ~ neq(X1,nil) ),
inference(rw,[status(thm)],[inference(rw,[status(thm)],[c_0_21,c_0_22]),c_0_19]) ).
cnf(c_0_30,plain,
( ~ ssList(X2)
| ~ ssList(X1)
| X2 = X1
| neq(X2,X1) ),
c_0_23 ).
cnf(c_0_31,axiom,
ssList(nil),
clause8 ).
cnf(c_0_32,plain,
( ~ ssList(X1)
| ~ ssList(X2)
| frontsegP(app(X1,X2),X1) ),
inference(csr,[status(thm)],[inference(er,[status(thm)],[c_0_24]),c_0_25]) ).
cnf(c_0_33,negated_conjecture,
app(sk3,sk5) = sk4,
co1_10 ).
cnf(c_0_34,negated_conjecture,
ssList(sk5),
co1_9 ).
cnf(c_0_35,negated_conjecture,
ssList(sk3),
co1_3 ).
cnf(c_0_36,plain,
( ~ ssList(X1)
| ~ neq(X1,X1) ),
inference(er,[status(thm)],[c_0_26]) ).
cnf(c_0_37,negated_conjecture,
( sk3 != nil
| neq(nil,nil) ),
inference(spm,[status(thm)],[c_0_27,c_0_28]) ).
cnf(c_0_38,negated_conjecture,
( ~ ssList(X1)
| ~ frontsegP(sk4,X1)
| ~ frontsegP(sk3,X1)
| nil = X1 ),
inference(cn,[status(thm)],[inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_29,c_0_30]),c_0_31])]) ).
cnf(c_0_39,negated_conjecture,
frontsegP(sk4,sk3),
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_35])]) ).
cnf(c_0_40,negated_conjecture,
sk3 != nil,
inference(cn,[status(thm)],[inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_36,c_0_37]),c_0_31])]) ).
cnf(c_0_41,plain,
( ~ ssList(X1)
| frontsegP(X1,X1) ),
inference(fof_simplification,[status(thm)],[clause61]) ).
cnf(c_0_42,negated_conjecture,
~ frontsegP(sk3,sk3),
inference(sr,[status(thm)],[inference(cn,[status(thm)],[inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_38,c_0_39]),c_0_35])]),c_0_40]) ).
cnf(c_0_43,plain,
( ~ ssList(X1)
| frontsegP(X1,X1) ),
c_0_41 ).
cnf(c_0_44,negated_conjecture,
$false,
inference(cn,[status(thm)],[inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_42,c_0_43]),c_0_35])]),
[proof] ).
%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.00/0.03 % Problem : SWC024-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.11/0.37 % Computer : n009.cluster.edu
% 0.11/0.37 % Model : x86_64 x86_64
% 0.11/0.37 % CPU : Intel(R) Xeon(R) CPU E5-2620 v4 @ 2.10GHz
% 0.11/0.37 % Memory : 8046.5625MB
% 0.11/0.37 % OS : Linux 6.8.0-71-generic
% 0.11/0.37 % CPULimit : 300
% 0.11/0.37 % WCLimit : 300
% 0.11/0.37 % DateTime : Mon Sep 21 07:49:43 UTC 2026
% 0.11/0.37 % CPUTime :
% 0.11/0.37 Running run_E /export/starexec/sandbox/benchmark/theBenchmark.p 300 THM
% 0.11/0.41 Running first-order theorem proving
% 0.11/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.11/0.45 % Version: 3.5.1
% 0.11/0.45 % Preprocessing class: FSLSSMSMSSSNFFN.
% 0.11/0.45 % Scheduled 4 strats onto 8 cores with 300 seconds (2400 total)
% 0.11/0.45 % Starting C07_19_nc_SOS_SAT001_MinMin_p005000_rr with 1500s (5) cores
% 0.11/0.45 % Starting new_bool_3 with 300s (1) cores
% 0.11/0.45 % Starting new_bool_1 with 300s (1) cores
% 0.11/0.45 % Starting sh5l with 300s (1) cores
% 0.11/0.45 % new_bool_3 with pid 1241817 completed with status 0
% 0.11/0.45 % Result found by new_bool_3
% 0.11/0.45 % Preprocessing class: FSLSSMSMSSSNFFN.
% 0.11/0.45 % Scheduled 4 strats onto 8 cores with 300 seconds (2400 total)
% 0.11/0.45 % Starting C07_19_nc_SOS_SAT001_MinMin_p005000_rr with 1500s (5) cores
% 0.11/0.45 % Starting new_bool_3 with 300s (1) cores
% 0.11/0.45 % (lift_lambdas = 0, lambda_to_forall = 0,unroll_only_formulas = 0, sine = GSinE(CountFormulas,hypos,1.5,,3,20000,1.0))
% 0.11/0.45 % SinE strategy is GSinE(CountFormulas,hypos,1.5,,3,20000,1.0)
% 0.11/0.45 % Search class: FGHSF-FFMM22-MFFFFFNN
% 0.11/0.45 % partial match(1): FGHSF-FFMM21-MFFFFFNN
% 0.11/0.45 % Scheduled 5 strats onto 1 cores with 300 seconds (300 total)
% 0.11/0.45 % Starting SubtermCWHack with 31s (1) cores
% 0.11/0.45 % SubtermCWHack with pid 1241824 completed with status 0
% 0.11/0.45 % Result found by SubtermCWHack
% 0.11/0.45 % Preprocessing class: FSLSSMSMSSSNFFN.
% 0.11/0.45 % Scheduled 4 strats onto 8 cores with 300 seconds (2400 total)
% 0.11/0.45 % Starting C07_19_nc_SOS_SAT001_MinMin_p005000_rr with 1500s (5) cores
% 0.11/0.45 % Starting new_bool_3 with 300s (1) cores
% 0.11/0.45 % (lift_lambdas = 0, lambda_to_forall = 0,unroll_only_formulas = 0, sine = GSinE(CountFormulas,hypos,1.5,,3,20000,1.0))
% 0.11/0.45 % SinE strategy is GSinE(CountFormulas,hypos,1.5,,3,20000,1.0)
% 0.11/0.45 % Search class: FGHSF-FFMM22-MFFFFFNN
% 0.11/0.45 % partial match(1): FGHSF-FFMM21-MFFFFFNN
% 0.11/0.45 % Scheduled 5 strats onto 1 cores with 300 seconds (300 total)
% 0.11/0.45 % Starting SubtermCWHack with 31s (1) cores
% 0.11/0.45 % Preprocessing time : 0.002 s
% 0.11/0.45
% 0.11/0.45 % Proof found!
% 0.11/0.45 % SZS status Unsatisfiable
% 0.11/0.45 % SZS output start CNFRefutation
% See solution above
% 0.11/0.45 % Parsed axioms : 198
% 0.11/0.45 % Removed by relevancy pruning/SinE : 150
% 0.11/0.45 % Initial clauses : 48
% 0.11/0.45 % Removed in clause preprocessing : 0
% 0.11/0.45 % Initial clauses in saturation : 48
% 0.11/0.45 % Processed clauses : 53
% 0.11/0.45 % ...of these trivial : 0
% 0.11/0.45 % ...subsumed : 3
% 0.11/0.45 % ...remaining for further processing : 50
% 0.11/0.45 % Other redundant clauses eliminated : 6
% 0.11/0.45 % Clauses deleted for lack of memory : 0
% 0.11/0.45 % Backward-subsumed : 5
% 0.11/0.45 % Backward-rewritten : 2
% 0.11/0.45 % Generated clauses : 39
% 0.11/0.45 % ...of the previous two non-redundant : 28
% 0.11/0.45 % ...aggressively subsumed : 0
% 0.11/0.45 % Contextual simplify-reflections : 1
% 0.11/0.45 % Paramodulations : 34
% 0.11/0.45 % Factorizations : 0
% 0.11/0.45 % NegExts : 0
% 0.11/0.45 % Equation resolutions : 6
% 0.11/0.45 % Disequality decompositions : 0
% 0.11/0.45 % Total rewrite steps : 46
% 0.11/0.45 % ...of those cached : 39
% 0.11/0.45 % Propositional unsat checks : 0
% 0.11/0.45 % Propositional check models : 0
% 0.11/0.45 % Propositional check unsatisfiable : 0
% 0.11/0.45 % Propositional clauses : 0
% 0.11/0.45 % Propositional clauses after purity: 0
% 0.11/0.45 % Propositional unsat core size : 0
% 0.11/0.45 % Propositional preprocessing time : 0.000
% 0.11/0.45 % Propositional encoding time : 0.000
% 0.11/0.45 % Propositional solver time : 0.000
% 0.11/0.45 % Success case prop preproc time : 0.000
% 0.11/0.45 % Success case prop encoding time : 0.000
% 0.11/0.45 % Success case prop solver time : 0.000
% 0.11/0.45 % Current number of processed clauses : 38
% 0.11/0.45 % Positive orientable unit clauses : 13
% 0.11/0.45 % Positive unorientable unit clauses: 0
% 0.11/0.45 % Negative unit clauses : 4
% 0.11/0.45 % Non-unit-clauses : 21
% 0.11/0.45 % Current number of unprocessed clauses: 21
% 0.11/0.45 % ...number of literals in the above : 104
% 0.11/0.45 % Current number of archived formulas : 0
% 0.11/0.45 % Current number of archived clauses : 7
% 0.11/0.45 % Clause-clause subsumption calls (NU) : 91
% 0.11/0.45 % Rec. Clause-clause subsumption calls : 55
% 0.11/0.45 % Non-unit clause-clause subsumptions : 3
% 0.11/0.45 % Unit Clause-clause subsumption calls : 20
% 0.11/0.45 % Rewrite failures with RHS unbound : 0
% 0.11/0.45 % BW rewrite match attempts : 2
% 0.11/0.45 % BW rewrite match successes : 2
% 0.11/0.45 % Condensation attempts : 0
% 0.11/0.45 % Condensation successes : 0
% 0.11/0.45 % Termbank termtop insertions : 3921
% 0.11/0.45 % Search garbage collected termcells : 915
% 0.11/0.45
% 0.11/0.45 % -------------------------------------------------
% 0.11/0.45 % User time : 0.004 s
% 0.11/0.45 % System time : 0.003 s
% 0.11/0.45 % Total time : 0.008 s
% 0.11/0.45 % Maximum resident set size: 3760 pages
% 0.11/0.45
% 0.11/0.45 % -------------------------------------------------
% 0.11/0.45 % User time : 0.007 s
% 0.11/0.45 % System time : 0.011 s
% 0.11/0.45 % Total time : 0.018 s
% 0.11/0.45 % Maximum resident set size: 5120 pages
% 0.11/0.45 % E exiting
%------------------------------------------------------------------------------