%------------------------------------------------------------------------------
% File : E---3.5.1
% Problem : SWC023-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 : n026.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:39 PM UTC 2026
% Result : Unsatisfiable 0.18s 0.46s
% Output : CNFRefutation 0.18s
% Verified :
% SZS Type : Refutation
% Derivation depth : 9
% Number of leaves : 17
% Syntax : Number of clauses : 52 ( 16 unt; 17 nHn; 52 RR)
% Number of literals : 108 ( 33 equ; 50 neg)
% Maximal clause size : 4 ( 2 avg)
% Maximal term depth : 1 ( 1 avg)
% Number of predicates : 5 ( 3 usr; 1 prp; 0-2 aty)
% Number of functors : 6 ( 6 usr; 6 con; 0-0 aty)
% Number of variables : 20 ( 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(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_14,negated_conjecture,
( nil = sk3
| neq(sk5,nil) ),
file('/export/starexec/sandbox/benchmark/theBenchmark.p',co1_14) ).
cnf(co1_10,negated_conjecture,
( nil = sk3
| ssList(sk5) ),
file('/export/starexec/sandbox/benchmark/theBenchmark.p',co1_10) ).
cnf(co1_15,negated_conjecture,
( nil = sk3
| frontsegP(sk4,sk5) ),
file('/export/starexec/sandbox/benchmark/theBenchmark.p',co1_15) ).
cnf(co1_16,negated_conjecture,
( nil = sk3
| frontsegP(sk3,sk5) ),
file('/export/starexec/sandbox/benchmark/theBenchmark.p',co1_16) ).
cnf(co1_7,negated_conjecture,
neq(sk2,nil),
file('/export/starexec/sandbox/benchmark/theBenchmark.p',co1_7) ).
cnf(clause84,axiom,
( ~ ssList(X1)
| ~ frontsegP(nil,X1)
| nil = X1 ),
file('/export/starexec/sandbox/benchmark/Axioms/SWC001-0.ax',clause84) ).
cnf(co1_13,negated_conjecture,
( nil = sk4
| frontsegP(sk3,sk5) ),
file('/export/starexec/sandbox/benchmark/theBenchmark.p',co1_13) ).
cnf(co1_4,negated_conjecture,
ssList(sk4),
file('/export/starexec/sandbox/benchmark/theBenchmark.p',co1_4) ).
cnf(clause115,axiom,
( ~ ssList(X1)
| ~ ssList(X2)
| ~ neq(X1,X2)
| X1 != X2 ),
file('/export/starexec/sandbox/benchmark/Axioms/SWC001-0.ax',clause115) ).
cnf(co1_9,negated_conjecture,
( nil = sk4
| ssList(sk5) ),
file('/export/starexec/sandbox/benchmark/theBenchmark.p',co1_9) ).
cnf(clause61,axiom,
( ~ ssList(X1)
| frontsegP(X1,X1) ),
file('/export/starexec/sandbox/benchmark/Axioms/SWC001-0.ax',clause61) ).
cnf(co1_11,negated_conjecture,
( nil = sk4
| neq(sk5,nil) ),
file('/export/starexec/sandbox/benchmark/theBenchmark.p',co1_11) ).
cnf(clause83,axiom,
( ~ ssList(X1)
| nil != X1
| frontsegP(nil,X1) ),
file('/export/starexec/sandbox/benchmark/Axioms/SWC001-0.ax',clause83) ).
cnf(clause8,axiom,
ssList(nil),
file('/export/starexec/sandbox/benchmark/Axioms/SWC001-0.ax',clause8) ).
cnf(c_0_17,negated_conjecture,
( ~ frontsegP(sk1,X1)
| ~ frontsegP(sk2,X1)
| ~ neq(X1,nil)
| ~ ssList(X1) ),
inference(fof_simplification,[status(thm)],[co1_8]) ).
cnf(c_0_18,negated_conjecture,
( ~ frontsegP(sk1,X1)
| ~ frontsegP(sk2,X1)
| ~ neq(X1,nil)
| ~ ssList(X1) ),
c_0_17 ).
cnf(c_0_19,negated_conjecture,
sk1 = sk3,
co1_6 ).
cnf(c_0_20,negated_conjecture,
sk2 = sk4,
co1_5 ).
cnf(c_0_21,negated_conjecture,
( ~ ssList(X1)
| ~ frontsegP(sk4,X1)
| ~ frontsegP(sk3,X1)
| ~ neq(X1,nil) ),
inference(rw,[status(thm)],[inference(rw,[status(thm)],[c_0_18,c_0_19]),c_0_20]) ).
cnf(c_0_22,negated_conjecture,
( nil = sk3
| neq(sk5,nil) ),
co1_14 ).
cnf(c_0_23,negated_conjecture,
( nil = sk3
| ssList(sk5) ),
co1_10 ).
cnf(c_0_24,negated_conjecture,
( nil = sk3
| frontsegP(sk4,sk5) ),
co1_15 ).
cnf(c_0_25,negated_conjecture,
( nil = sk3
| frontsegP(sk3,sk5) ),
co1_16 ).
cnf(c_0_26,negated_conjecture,
neq(sk2,nil),
co1_7 ).
cnf(c_0_27,plain,
( ~ ssList(X1)
| ~ frontsegP(nil,X1)
| nil = X1 ),
inference(fof_simplification,[status(thm)],[clause84]) ).
cnf(c_0_28,negated_conjecture,
( nil = sk4
| frontsegP(sk3,sk5) ),
co1_13 ).
cnf(c_0_29,negated_conjecture,
sk3 = nil,
inference(csr,[status(thm)],[inference(csr,[status(thm)],[inference(csr,[status(thm)],[inference(spm,[status(thm)],[c_0_21,c_0_22]),c_0_23]),c_0_24]),c_0_25]) ).
cnf(c_0_30,negated_conjecture,
neq(sk4,nil),
inference(rw,[status(thm)],[c_0_26,c_0_20]) ).
cnf(c_0_31,negated_conjecture,
ssList(sk4),
co1_4 ).
cnf(c_0_32,plain,
( ~ ssList(X1)
| ~ ssList(X2)
| ~ neq(X1,X2)
| X1 != X2 ),
inference(fof_simplification,[status(thm)],[clause115]) ).
cnf(c_0_33,plain,
( ~ ssList(X1)
| ~ frontsegP(nil,X1)
| nil = X1 ),
c_0_27 ).
cnf(c_0_34,negated_conjecture,
( frontsegP(nil,sk5)
| sk4 = nil ),
inference(rw,[status(thm)],[c_0_28,c_0_29]) ).
cnf(c_0_35,negated_conjecture,
( nil = sk4
| ssList(sk5) ),
co1_9 ).
cnf(c_0_36,negated_conjecture,
( ~ frontsegP(sk4,sk4)
| ~ frontsegP(sk3,sk4) ),
inference(cn,[status(thm)],[inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_21,c_0_30]),c_0_31])]) ).
cnf(c_0_37,plain,
( ~ ssList(X1)
| frontsegP(X1,X1) ),
inference(fof_simplification,[status(thm)],[clause61]) ).
cnf(c_0_38,plain,
( ~ ssList(X1)
| ~ ssList(X2)
| ~ neq(X1,X2)
| X1 != X2 ),
c_0_32 ).
cnf(c_0_39,negated_conjecture,
( nil = sk4
| neq(sk5,nil) ),
co1_11 ).
cnf(c_0_40,negated_conjecture,
( sk5 = nil
| sk4 = nil ),
inference(csr,[status(thm)],[inference(spm,[status(thm)],[c_0_33,c_0_34]),c_0_35]) ).
cnf(c_0_41,plain,
( ~ ssList(X1)
| nil != X1
| frontsegP(nil,X1) ),
inference(fof_simplification,[status(thm)],[clause83]) ).
cnf(c_0_42,negated_conjecture,
( ~ frontsegP(sk4,sk4)
| ~ frontsegP(nil,sk4) ),
inference(rw,[status(thm)],[c_0_36,c_0_29]) ).
cnf(c_0_43,plain,
( ~ ssList(X1)
| frontsegP(X1,X1) ),
c_0_37 ).
cnf(c_0_44,plain,
( ~ ssList(X1)
| ~ neq(X1,X1) ),
inference(er,[status(thm)],[c_0_38]) ).
cnf(c_0_45,negated_conjecture,
( neq(nil,nil)
| sk4 = nil ),
inference(spm,[status(thm)],[c_0_39,c_0_40]) ).
cnf(c_0_46,axiom,
ssList(nil),
clause8 ).
cnf(c_0_47,plain,
( ~ ssList(X1)
| nil != X1
| frontsegP(nil,X1) ),
c_0_41 ).
cnf(c_0_48,negated_conjecture,
~ frontsegP(nil,sk4),
inference(cn,[status(thm)],[inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_42,c_0_43]),c_0_31])]) ).
cnf(c_0_49,negated_conjecture,
sk4 = nil,
inference(cn,[status(thm)],[inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_44,c_0_45]),c_0_46])]) ).
cnf(c_0_50,plain,
frontsegP(nil,nil),
inference(cn,[status(thm)],[inference(rw,[status(thm)],[inference(er,[status(thm)],[c_0_47]),c_0_46])]) ).
cnf(c_0_51,negated_conjecture,
$false,
inference(cn,[status(thm)],[inference(rw,[status(thm)],[inference(rw,[status(thm)],[c_0_48,c_0_49]),c_0_50])]),
[proof] ).
%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.00/0.03 % Problem : SWC023-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 : n026.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:52:39 UTC 2026
% 0.11/0.38 % CPUTime :
% 0.11/0.38 Running run_E /export/starexec/sandbox/benchmark/theBenchmark.p 300 THM
% 0.11/0.42 Running first-order theorem proving
% 0.11/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.18/0.46 % Version: 3.5.1
% 0.18/0.46 % Preprocessing class: FSLSSMSMSSSNFFN.
% 0.18/0.46 % Scheduled 4 strats onto 8 cores with 300 seconds (2400 total)
% 0.18/0.46 % Starting C07_19_nc_SOS_SAT001_MinMin_p005000_rr with 1500s (5) cores
% 0.18/0.46 % Starting new_bool_3 with 300s (1) cores
% 0.18/0.46 % Starting new_bool_1 with 300s (1) cores
% 0.18/0.46 % Starting sh5l with 300s (1) cores
% 0.18/0.46 % new_bool_3 with pid 1771901 completed with status 0
% 0.18/0.46 % Result found by new_bool_3
% 0.18/0.46 % Preprocessing class: FSLSSMSMSSSNFFN.
% 0.18/0.46 % Scheduled 4 strats onto 8 cores with 300 seconds (2400 total)
% 0.18/0.46 % Starting C07_19_nc_SOS_SAT001_MinMin_p005000_rr with 1500s (5) cores
% 0.18/0.46 % Starting new_bool_3 with 300s (1) cores
% 0.18/0.46 % (lift_lambdas = 0, lambda_to_forall = 0,unroll_only_formulas = 0, sine = GSinE(CountFormulas,hypos,1.5,,3,20000,1.0))
% 0.18/0.46 % SinE strategy is GSinE(CountFormulas,hypos,1.5,,3,20000,1.0)
% 0.18/0.46 % Search class: FGHSF-FFMM22-SFFFFFNN
% 0.18/0.46 % Scheduled 5 strats onto 1 cores with 300 seconds (300 total)
% 0.18/0.46 % Starting SubtermCWHack with 31s (1) cores
% 0.18/0.46 % SubtermCWHack with pid 1771905 completed with status 0
% 0.18/0.46 % Result found by SubtermCWHack
% 0.18/0.46 % Preprocessing class: FSLSSMSMSSSNFFN.
% 0.18/0.46 % Scheduled 4 strats onto 8 cores with 300 seconds (2400 total)
% 0.18/0.46 % Starting C07_19_nc_SOS_SAT001_MinMin_p005000_rr with 1500s (5) cores
% 0.18/0.46 % Starting new_bool_3 with 300s (1) cores
% 0.18/0.46 % (lift_lambdas = 0, lambda_to_forall = 0,unroll_only_formulas = 0, sine = GSinE(CountFormulas,hypos,1.5,,3,20000,1.0))
% 0.18/0.46 % SinE strategy is GSinE(CountFormulas,hypos,1.5,,3,20000,1.0)
% 0.18/0.46 % Search class: FGHSF-FFMM22-SFFFFFNN
% 0.18/0.46 % Scheduled 5 strats onto 1 cores with 300 seconds (300 total)
% 0.18/0.46 % Starting SubtermCWHack with 31s (1) cores
% 0.18/0.46 % Preprocessing time : 0.002 s
% 0.18/0.46
% 0.18/0.46 % Proof found!
% 0.18/0.46 % SZS status Unsatisfiable
% 0.18/0.46 % SZS output start CNFRefutation
% See solution above
% 0.18/0.46 % Parsed axioms : 201
% 0.18/0.46 % Removed by relevancy pruning/SinE : 153
% 0.18/0.46 % Initial clauses : 48
% 0.18/0.46 % Removed in clause preprocessing : 0
% 0.18/0.46 % Initial clauses in saturation : 48
% 0.18/0.46 % Processed clauses : 47
% 0.18/0.46 % ...of these trivial : 0
% 0.18/0.46 % ...subsumed : 0
% 0.18/0.46 % ...remaining for further processing : 47
% 0.18/0.46 % Other redundant clauses eliminated : 5
% 0.18/0.46 % Clauses deleted for lack of memory : 0
% 0.18/0.46 % Backward-subsumed : 1
% 0.18/0.46 % Backward-rewritten : 22
% 0.18/0.46 % Generated clauses : 21
% 0.18/0.46 % ...of the previous two non-redundant : 19
% 0.18/0.46 % ...aggressively subsumed : 0
% 0.18/0.46 % Contextual simplify-reflections : 4
% 0.18/0.46 % Paramodulations : 17
% 0.18/0.46 % Factorizations : 0
% 0.18/0.46 % NegExts : 0
% 0.18/0.46 % Equation resolutions : 5
% 0.18/0.46 % Disequality decompositions : 0
% 0.18/0.46 % Total rewrite steps : 34
% 0.18/0.46 % ...of those cached : 26
% 0.18/0.46 % Propositional unsat checks : 0
% 0.18/0.46 % Propositional check models : 0
% 0.18/0.46 % Propositional check unsatisfiable : 0
% 0.18/0.46 % Propositional clauses : 0
% 0.18/0.46 % Propositional clauses after purity: 0
% 0.18/0.46 % Propositional unsat core size : 0
% 0.18/0.46 % Propositional preprocessing time : 0.000
% 0.18/0.46 % Propositional encoding time : 0.000
% 0.18/0.46 % Propositional solver time : 0.000
% 0.18/0.46 % Success case prop preproc time : 0.000
% 0.18/0.46 % Success case prop encoding time : 0.000
% 0.18/0.46 % Success case prop solver time : 0.000
% 0.18/0.46 % Current number of processed clauses : 20
% 0.18/0.46 % Positive orientable unit clauses : 6
% 0.18/0.46 % Positive unorientable unit clauses: 0
% 0.18/0.46 % Negative unit clauses : 0
% 0.18/0.46 % Non-unit-clauses : 14
% 0.18/0.46 % Current number of unprocessed clauses: 20
% 0.18/0.46 % ...number of literals in the above : 97
% 0.18/0.46 % Current number of archived formulas : 0
% 0.18/0.46 % Current number of archived clauses : 23
% 0.18/0.46 % Clause-clause subsumption calls (NU) : 74
% 0.18/0.46 % Rec. Clause-clause subsumption calls : 42
% 0.18/0.46 % Non-unit clause-clause subsumptions : 4
% 0.18/0.46 % Unit Clause-clause subsumption calls : 3
% 0.18/0.46 % Rewrite failures with RHS unbound : 0
% 0.18/0.46 % BW rewrite match attempts : 4
% 0.18/0.46 % BW rewrite match successes : 4
% 0.18/0.46 % Condensation attempts : 0
% 0.18/0.46 % Condensation successes : 0
% 0.18/0.46 % Termbank termtop insertions : 3546
% 0.18/0.46 % Search garbage collected termcells : 909
% 0.18/0.46
% 0.18/0.46 % -------------------------------------------------
% 0.18/0.46 % User time : 0.002 s
% 0.18/0.46 % System time : 0.007 s
% 0.18/0.46 % Total time : 0.009 s
% 0.18/0.46 % Maximum resident set size: 3812 pages
% 0.18/0.46
% 0.18/0.46 % -------------------------------------------------
% 0.18/0.46 % User time : 0.007 s
% 0.18/0.46 % System time : 0.011 s
% 0.18/0.46 % Total time : 0.018 s
% 0.18/0.46 % Maximum resident set size: 4864 pages
% 0.18/0.46 % E exiting
%------------------------------------------------------------------------------