%------------------------------------------------------------------------------
% File : E---3.5.1
% Problem : SWC206-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 : n002.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:43:27 PM UTC 2026
% Result : Unsatisfiable 0.27s 0.54s
% Output : CNFRefutation 0.27s
% Verified :
% SZS Type : Refutation
% Derivation depth : 7
% Number of leaves : 11
% Syntax : Number of clauses : 38 ( 23 unt; 3 nHn; 38 RR)
% Number of literals : 62 ( 12 equ; 26 neg)
% Maximal clause size : 4 ( 1 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 : 9 ( 0 sgn)
% Comments :
%------------------------------------------------------------------------------
cnf(co1_8,negated_conjecture,
~ neq(sk1,nil),
file('/export/starexec/sandbox2/benchmark/theBenchmark.p',co1_8) ).
cnf(co1_13,negated_conjecture,
( ~ neq(sk4,nil)
| segmentP(sk3,sk5) ),
file('/export/starexec/sandbox2/benchmark/theBenchmark.p',co1_13) ).
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_6,negated_conjecture,
sk1 = sk3,
file('/export/starexec/sandbox2/benchmark/theBenchmark.p',co1_6) ).
cnf(clause100,axiom,
( ~ ssList(X2)
| ~ ssList(X1)
| X2 = X1
| neq(X2,X1) ),
file('/export/starexec/sandbox2/benchmark/Axioms/SWC001-0.ax',clause100) ).
cnf(co1_3,negated_conjecture,
ssList(sk3),
file('/export/starexec/sandbox2/benchmark/theBenchmark.p',co1_3) ).
cnf(clause8,axiom,
ssList(nil),
file('/export/starexec/sandbox2/benchmark/Axioms/SWC001-0.ax',clause8) ).
cnf(co1_10,negated_conjecture,
( ~ neq(sk4,nil)
| ssList(sk5) ),
file('/export/starexec/sandbox2/benchmark/theBenchmark.p',co1_10) ).
cnf(co1_11,negated_conjecture,
( ~ neq(sk4,nil)
| neq(sk5,nil) ),
file('/export/starexec/sandbox2/benchmark/theBenchmark.p',co1_11) ).
cnf(clause80,axiom,
( ~ ssList(X1)
| ~ segmentP(nil,X1)
| nil = X1 ),
file('/export/starexec/sandbox2/benchmark/Axioms/SWC001-0.ax',clause80) ).
cnf(c_0_11,negated_conjecture,
~ neq(sk1,nil),
inference(fof_simplification,[status(thm)],[co1_8]) ).
cnf(c_0_12,negated_conjecture,
( ~ neq(sk4,nil)
| segmentP(sk3,sk5) ),
inference(fof_simplification,[status(thm)],[co1_13]) ).
cnf(c_0_13,negated_conjecture,
neq(sk2,nil),
co1_7 ).
cnf(c_0_14,negated_conjecture,
sk2 = sk4,
co1_5 ).
cnf(c_0_15,negated_conjecture,
~ neq(sk1,nil),
c_0_11 ).
cnf(c_0_16,negated_conjecture,
sk1 = sk3,
co1_6 ).
cnf(c_0_17,plain,
( ~ ssList(X2)
| ~ ssList(X1)
| X2 = X1
| neq(X2,X1) ),
inference(fof_simplification,[status(thm)],[clause100]) ).
cnf(c_0_18,negated_conjecture,
( ~ neq(sk4,nil)
| segmentP(sk3,sk5) ),
c_0_12 ).
cnf(c_0_19,negated_conjecture,
neq(sk4,nil),
inference(rw,[status(thm)],[c_0_13,c_0_14]) ).
cnf(c_0_20,negated_conjecture,
~ neq(sk3,nil),
inference(rw,[status(thm)],[c_0_15,c_0_16]) ).
cnf(c_0_21,plain,
( ~ ssList(X2)
| ~ ssList(X1)
| X2 = X1
| neq(X2,X1) ),
c_0_17 ).
cnf(c_0_22,negated_conjecture,
ssList(sk3),
co1_3 ).
cnf(c_0_23,axiom,
ssList(nil),
clause8 ).
cnf(c_0_24,negated_conjecture,
( ~ neq(sk4,nil)
| ssList(sk5) ),
inference(fof_simplification,[status(thm)],[co1_10]) ).
cnf(c_0_25,negated_conjecture,
( ~ neq(sk4,nil)
| neq(sk5,nil) ),
inference(fof_simplification,[status(thm)],[co1_11]) ).
cnf(c_0_26,plain,
( ~ ssList(X1)
| ~ segmentP(nil,X1)
| nil = X1 ),
inference(fof_simplification,[status(thm)],[clause80]) ).
cnf(c_0_27,negated_conjecture,
segmentP(sk3,sk5),
inference(cn,[status(thm)],[inference(rw,[status(thm)],[c_0_18,c_0_19])]) ).
cnf(c_0_28,negated_conjecture,
sk3 = nil,
inference(cn,[status(thm)],[inference(rw,[status(thm)],[inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_20,c_0_21]),c_0_22]),c_0_23])]) ).
cnf(c_0_29,negated_conjecture,
( ~ neq(sk4,nil)
| ssList(sk5) ),
c_0_24 ).
cnf(c_0_30,negated_conjecture,
( ~ neq(sk4,nil)
| neq(sk5,nil) ),
c_0_25 ).
cnf(c_0_31,plain,
( ~ ssList(X1)
| ~ segmentP(nil,X1)
| nil = X1 ),
c_0_26 ).
cnf(c_0_32,negated_conjecture,
segmentP(nil,sk5),
inference(rw,[status(thm)],[c_0_27,c_0_28]) ).
cnf(c_0_33,negated_conjecture,
ssList(sk5),
inference(cn,[status(thm)],[inference(rw,[status(thm)],[c_0_29,c_0_19])]) ).
cnf(c_0_34,negated_conjecture,
neq(sk5,nil),
inference(cn,[status(thm)],[inference(rw,[status(thm)],[c_0_30,c_0_19])]) ).
cnf(c_0_35,negated_conjecture,
sk5 = nil,
inference(cn,[status(thm)],[inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_31,c_0_32]),c_0_33])]) ).
cnf(c_0_36,negated_conjecture,
~ neq(nil,nil),
inference(rw,[status(thm)],[c_0_20,c_0_28]) ).
cnf(c_0_37,negated_conjecture,
$false,
inference(sr,[status(thm)],[inference(rw,[status(thm)],[c_0_34,c_0_35]),c_0_36]),
[proof] ).
%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.00/0.04 % Problem : SWC206-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.20/0.45 % Computer : n002.cluster.edu
% 0.20/0.45 % Model : x86_64 x86_64
% 0.20/0.45 % CPU : Intel(R) Xeon(R) CPU E5-2620 v4 @ 2.10GHz
% 0.20/0.45 % Memory : 8046.5625MB
% 0.20/0.45 % OS : Linux 6.8.0-71-generic
% 0.20/0.45 % CPULimit : 300
% 0.20/0.45 % WCLimit : 300
% 0.20/0.45 % DateTime : Mon Sep 21 08:07:32 UTC 2026
% 0.20/0.45 % CPUTime :
% 0.20/0.45 Running run_E /export/starexec/sandbox2/benchmark/theBenchmark.p 300 THM
% 0.20/0.50 Running first-order theorem proving
% 0.20/0.50 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.27/0.54 % Version: 3.5.1
% 0.27/0.54 % Preprocessing class: FSLSSMSMSSSNFFN.
% 0.27/0.54 % Scheduled 4 strats onto 8 cores with 300 seconds (2400 total)
% 0.27/0.54 % Starting C07_19_nc_SOS_SAT001_MinMin_p005000_rr with 1500s (5) cores
% 0.27/0.54 % Starting new_bool_3 with 300s (1) cores
% 0.27/0.54 % Starting new_bool_1 with 300s (1) cores
% 0.27/0.54 % Starting sh5l with 300s (1) cores
% 0.27/0.54 % new_bool_3 with pid 2830750 completed with status 0
% 0.27/0.54 % Result found by new_bool_3
% 0.27/0.54 % Preprocessing class: FSLSSMSMSSSNFFN.
% 0.27/0.54 % Scheduled 4 strats onto 8 cores with 300 seconds (2400 total)
% 0.27/0.54 % Starting C07_19_nc_SOS_SAT001_MinMin_p005000_rr with 1500s (5) cores
% 0.27/0.54 % Starting new_bool_3 with 300s (1) cores
% 0.27/0.54 % (lift_lambdas = 0, lambda_to_forall = 0,unroll_only_formulas = 0, sine = GSinE(CountFormulas,hypos,1.5,,3,20000,1.0))
% 0.27/0.54 % SinE strategy is GSinE(CountFormulas,hypos,1.5,,3,20000,1.0)
% 0.27/0.54 % Search class: FGHSF-FFMM22-SFFFFFNN
% 0.27/0.54 % Scheduled 5 strats onto 1 cores with 300 seconds (300 total)
% 0.27/0.54 % Starting SubtermCWHack with 31s (1) cores
% 0.27/0.54 % SubtermCWHack with pid 2830753 completed with status 0
% 0.27/0.54 % Result found by SubtermCWHack
% 0.27/0.54 % Preprocessing class: FSLSSMSMSSSNFFN.
% 0.27/0.54 % Scheduled 4 strats onto 8 cores with 300 seconds (2400 total)
% 0.27/0.54 % Starting C07_19_nc_SOS_SAT001_MinMin_p005000_rr with 1500s (5) cores
% 0.27/0.54 % Starting new_bool_3 with 300s (1) cores
% 0.27/0.54 % (lift_lambdas = 0, lambda_to_forall = 0,unroll_only_formulas = 0, sine = GSinE(CountFormulas,hypos,1.5,,3,20000,1.0))
% 0.27/0.54 % SinE strategy is GSinE(CountFormulas,hypos,1.5,,3,20000,1.0)
% 0.27/0.54 % Search class: FGHSF-FFMM22-SFFFFFNN
% 0.27/0.54 % Scheduled 5 strats onto 1 cores with 300 seconds (300 total)
% 0.27/0.54 % Starting SubtermCWHack with 31s (1) cores
% 0.27/0.54 % Preprocessing time : 0.003 s
% 0.27/0.54
% 0.27/0.54 % Proof found!
% 0.27/0.54 % SZS status Unsatisfiable
% 0.27/0.54 % SZS output start CNFRefutation
% See solution above
% 0.27/0.54 % Parsed axioms : 198
% 0.27/0.54 % Removed by relevancy pruning/SinE : 156
% 0.27/0.54 % Initial clauses : 42
% 0.27/0.54 % Removed in clause preprocessing : 0
% 0.27/0.54 % Initial clauses in saturation : 42
% 0.27/0.54 % Processed clauses : 38
% 0.27/0.54 % ...of these trivial : 0
% 0.27/0.54 % ...subsumed : 0
% 0.27/0.54 % ...remaining for further processing : 38
% 0.27/0.54 % Other redundant clauses eliminated : 1
% 0.27/0.54 % Clauses deleted for lack of memory : 0
% 0.27/0.54 % Backward-subsumed : 6
% 0.27/0.54 % Backward-rewritten : 10
% 0.27/0.54 % Generated clauses : 16
% 0.27/0.54 % ...of the previous two non-redundant : 13
% 0.27/0.54 % ...aggressively subsumed : 0
% 0.27/0.54 % Contextual simplify-reflections : 1
% 0.27/0.54 % Paramodulations : 15
% 0.27/0.54 % Factorizations : 0
% 0.27/0.54 % NegExts : 0
% 0.27/0.54 % Equation resolutions : 1
% 0.27/0.54 % Disequality decompositions : 0
% 0.27/0.54 % Total rewrite steps : 29
% 0.27/0.54 % ...of those cached : 19
% 0.27/0.54 % Propositional unsat checks : 0
% 0.27/0.54 % Propositional check models : 0
% 0.27/0.54 % Propositional check unsatisfiable : 0
% 0.27/0.54 % Propositional clauses : 0
% 0.27/0.54 % Propositional clauses after purity: 0
% 0.27/0.54 % Propositional unsat core size : 0
% 0.27/0.54 % Propositional preprocessing time : 0.000
% 0.27/0.54 % Propositional encoding time : 0.000
% 0.27/0.54 % Propositional solver time : 0.000
% 0.27/0.54 % Success case prop preproc time : 0.000
% 0.27/0.54 % Success case prop encoding time : 0.000
% 0.27/0.54 % Success case prop solver time : 0.000
% 0.27/0.54 % Current number of processed clauses : 21
% 0.27/0.54 % Positive orientable unit clauses : 8
% 0.27/0.54 % Positive unorientable unit clauses: 0
% 0.27/0.54 % Negative unit clauses : 2
% 0.27/0.54 % Non-unit-clauses : 11
% 0.27/0.54 % Current number of unprocessed clauses: 17
% 0.27/0.54 % ...number of literals in the above : 80
% 0.27/0.54 % Current number of archived formulas : 0
% 0.27/0.54 % Current number of archived clauses : 16
% 0.27/0.54 % Clause-clause subsumption calls (NU) : 23
% 0.27/0.54 % Rec. Clause-clause subsumption calls : 22
% 0.27/0.54 % Non-unit clause-clause subsumptions : 1
% 0.27/0.54 % Unit Clause-clause subsumption calls : 6
% 0.27/0.54 % Rewrite failures with RHS unbound : 0
% 0.27/0.54 % BW rewrite match attempts : 4
% 0.27/0.54 % BW rewrite match successes : 4
% 0.27/0.54 % Condensation attempts : 0
% 0.27/0.54 % Condensation successes : 0
% 0.27/0.54 % Termbank termtop insertions : 3179
% 0.27/0.54 % Search garbage collected termcells : 913
% 0.27/0.54
% 0.27/0.54 % -------------------------------------------------
% 0.27/0.54 % User time : 0.008 s
% 0.27/0.54 % System time : 0.004 s
% 0.27/0.54 % Total time : 0.012 s
% 0.27/0.54 % Maximum resident set size: 3812 pages
% 0.27/0.54
% 0.27/0.54 % -------------------------------------------------
% 0.27/0.54 % User time : 0.016 s
% 0.27/0.54 % System time : 0.010 s
% 0.27/0.54 % Total time : 0.026 s
% 0.27/0.54 % Maximum resident set size: 5120 pages
% 0.27/0.54 % E exiting
%------------------------------------------------------------------------------