%------------------------------------------------------------------------------
% File : E---3.5.1
% Problem : SWC059-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 : 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:49 PM UTC 2026
% Result : Unsatisfiable 0.11s 0.47s
% Output : CNFRefutation 0.32s
% Verified :
% SZS Type : Refutation
% Derivation depth : 9
% Number of leaves : 12
% Syntax : Number of clauses : 41 ( 12 unt; 3 nHn; 41 RR)
% Number of literals : 85 ( 27 equ; 45 neg)
% Maximal clause size : 5 ( 2 avg)
% Maximal term depth : 1 ( 1 avg)
% Number of predicates : 5 ( 3 usr; 1 prp; 0-2 aty)
% Number of functors : 5 ( 5 usr; 5 con; 0-0 aty)
% Number of variables : 13 ( 0 sgn)
% Comments :
%------------------------------------------------------------------------------
cnf(co1_9,negated_conjecture,
( ~ neq(sk4,nil)
| segmentP(sk4,sk3) ),
file('/export/starexec/sandbox2/benchmark/theBenchmark.p',co1_9) ).
cnf(co1_8,negated_conjecture,
( ~ neq(sk4,nil)
| neq(sk3,nil) ),
file('/export/starexec/sandbox2/benchmark/theBenchmark.p',co1_8) ).
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(co1_11,negated_conjecture,
( ~ segmentP(sk1,X1)
| ~ segmentP(sk2,X1)
| ~ neq(X1,nil)
| ~ ssList(X1)
| nil = sk2 ),
file('/export/starexec/sandbox2/benchmark/theBenchmark.p',co1_11) ).
cnf(co1_10,negated_conjecture,
( neq(sk2,nil)
| nil = sk2 ),
file('/export/starexec/sandbox2/benchmark/theBenchmark.p',co1_10) ).
cnf(co1_7,negated_conjecture,
( nil != sk4
| nil = sk3 ),
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(clause57,axiom,
( ~ ssList(X1)
| segmentP(X1,X1) ),
file('/export/starexec/sandbox2/benchmark/Axioms/SWC001-0.ax',clause57) ).
cnf(clause115,axiom,
( ~ ssList(X1)
| ~ ssList(X2)
| ~ neq(X1,X2)
| X1 != X2 ),
file('/export/starexec/sandbox2/benchmark/Axioms/SWC001-0.ax',clause115) ).
cnf(co1_12,negated_conjecture,
( nil != sk1
| neq(sk2,nil) ),
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(c_0_12,negated_conjecture,
( ~ neq(sk4,nil)
| segmentP(sk4,sk3) ),
inference(fof_simplification,[status(thm)],[co1_9]) ).
cnf(c_0_13,negated_conjecture,
( ~ neq(sk4,nil)
| neq(sk3,nil) ),
inference(fof_simplification,[status(thm)],[co1_8]) ).
cnf(c_0_14,negated_conjecture,
( ~ neq(sk4,nil)
| segmentP(sk4,sk3) ),
c_0_12 ).
cnf(c_0_15,negated_conjecture,
sk2 = sk4,
co1_5 ).
cnf(c_0_16,negated_conjecture,
sk1 = sk3,
co1_6 ).
cnf(c_0_17,negated_conjecture,
( ~ segmentP(sk1,X1)
| ~ segmentP(sk2,X1)
| ~ neq(X1,nil)
| ~ ssList(X1)
| nil = sk2 ),
inference(fof_simplification,[status(thm)],[co1_11]) ).
cnf(c_0_18,negated_conjecture,
( ~ neq(sk4,nil)
| neq(sk3,nil) ),
c_0_13 ).
cnf(c_0_19,negated_conjecture,
( ~ neq(sk2,nil)
| segmentP(sk2,sk1) ),
inference(rw,[status(thm)],[inference(rw,[status(thm)],[inference(rw,[status(thm)],[c_0_14,c_0_15]),c_0_16]),c_0_15]) ).
cnf(c_0_20,negated_conjecture,
( neq(sk2,nil)
| nil = sk2 ),
co1_10 ).
cnf(c_0_21,negated_conjecture,
( nil != sk4
| nil = sk3 ),
inference(fof_simplification,[status(thm)],[co1_7]) ).
cnf(c_0_22,negated_conjecture,
( ~ segmentP(sk1,X1)
| ~ segmentP(sk2,X1)
| ~ neq(X1,nil)
| ~ ssList(X1)
| nil = sk2 ),
c_0_17 ).
cnf(c_0_23,negated_conjecture,
( ~ neq(sk2,nil)
| neq(sk1,nil) ),
inference(rw,[status(thm)],[inference(rw,[status(thm)],[c_0_18,c_0_16]),c_0_15]) ).
cnf(c_0_24,negated_conjecture,
ssList(sk1),
co1_1 ).
cnf(c_0_25,negated_conjecture,
( segmentP(sk2,sk1)
| sk2 = nil ),
inference(spm,[status(thm)],[c_0_19,c_0_20]) ).
cnf(c_0_26,plain,
( ~ ssList(X1)
| segmentP(X1,X1) ),
inference(fof_simplification,[status(thm)],[clause57]) ).
cnf(c_0_27,negated_conjecture,
( nil != sk4
| nil = sk3 ),
c_0_21 ).
cnf(c_0_28,negated_conjecture,
( ~ segmentP(sk1,sk1)
| sk2 = nil ),
inference(csr,[status(thm)],[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]),c_0_20]) ).
cnf(c_0_29,plain,
( ~ ssList(X1)
| segmentP(X1,X1) ),
c_0_26 ).
cnf(c_0_30,plain,
( ~ ssList(X1)
| ~ ssList(X2)
| ~ neq(X1,X2)
| X1 != X2 ),
inference(fof_simplification,[status(thm)],[clause115]) ).
cnf(c_0_31,negated_conjecture,
( nil != sk1
| neq(sk2,nil) ),
inference(fof_simplification,[status(thm)],[co1_12]) ).
cnf(c_0_32,negated_conjecture,
( sk2 != nil
| sk1 = nil ),
inference(rw,[status(thm)],[inference(rw,[status(thm)],[c_0_27,c_0_16]),c_0_15]) ).
cnf(c_0_33,negated_conjecture,
sk2 = nil,
inference(cn,[status(thm)],[inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_28,c_0_29]),c_0_24])]) ).
cnf(c_0_34,plain,
( ~ ssList(X1)
| ~ ssList(X2)
| ~ neq(X1,X2)
| X1 != X2 ),
c_0_30 ).
cnf(c_0_35,negated_conjecture,
( nil != sk1
| neq(sk2,nil) ),
c_0_31 ).
cnf(c_0_36,negated_conjecture,
sk1 = nil,
inference(cn,[status(thm)],[inference(rw,[status(thm)],[c_0_32,c_0_33])]) ).
cnf(c_0_37,plain,
( ~ ssList(X1)
| ~ neq(X1,X1) ),
inference(er,[status(thm)],[c_0_34]) ).
cnf(c_0_38,negated_conjecture,
neq(nil,nil),
inference(cn,[status(thm)],[inference(rw,[status(thm)],[inference(rw,[status(thm)],[c_0_35,c_0_33]),c_0_36])]) ).
cnf(c_0_39,axiom,
ssList(nil),
clause8 ).
cnf(c_0_40,negated_conjecture,
$false,
inference(cn,[status(thm)],[inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_37,c_0_38]),c_0_39])]),
[proof] ).
%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.00/0.04 % Problem : SWC059-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.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:51:57 UTC 2026
% 0.11/0.38 % CPUTime :
% 0.11/0.38 Running run_E /export/starexec/sandbox2/benchmark/theBenchmark.p 300 THM
% 0.11/0.42 Running first-order theorem proving
% 0.11/0.42 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.11/0.47 % Version: 3.5.1
% 0.11/0.47 % Preprocessing class: FSLSSMSSSSSNFFN.
% 0.11/0.47 % Scheduled 4 strats onto 8 cores with 300 seconds (2400 total)
% 0.11/0.47 % Starting G-E--_207_C18_F1_SE_CS_SP_PI_PS_S5PRR_S2S with 1500s (5) cores
% 0.11/0.47 % Starting new_bool_3 with 300s (1) cores
% 0.11/0.47 % Starting new_bool_1 with 300s (1) cores
% 0.11/0.47 % Starting sh5l with 300s (1) cores
% 0.11/0.47 % new_bool_3 with pid 1246746 completed with status 0
% 0.11/0.47 % Result found by new_bool_3
% 0.11/0.47 % Preprocessing class: FSLSSMSSSSSNFFN.
% 0.11/0.47 % Scheduled 4 strats onto 8 cores with 300 seconds (2400 total)
% 0.11/0.47 % Starting G-E--_207_C18_F1_SE_CS_SP_PI_PS_S5PRR_S2S with 1500s (5) cores
% 0.11/0.47 % Starting new_bool_3 with 300s (1) cores
% 0.11/0.47 % (lift_lambdas = 0, lambda_to_forall = 0,unroll_only_formulas = 0, sine = GSinE(CountFormulas,hypos,1.5,,3,20000,1.0))
% 0.11/0.47 % SinE strategy is GSinE(CountFormulas,hypos,1.5,,3,20000,1.0)
% 0.11/0.47 % Search class: FGHSF-FFMM22-SFFFFFNN
% 0.11/0.47 % Scheduled 5 strats onto 1 cores with 300 seconds (300 total)
% 0.11/0.47 % Starting SubtermCWHack with 31s (1) cores
% 0.11/0.47 % SubtermCWHack with pid 1246754 completed with status 0
% 0.11/0.47 % Result found by SubtermCWHack
% 0.11/0.47 % Preprocessing class: FSLSSMSSSSSNFFN.
% 0.11/0.47 % Scheduled 4 strats onto 8 cores with 300 seconds (2400 total)
% 0.11/0.47 % Starting G-E--_207_C18_F1_SE_CS_SP_PI_PS_S5PRR_S2S with 1500s (5) cores
% 0.11/0.47 % Starting new_bool_3 with 300s (1) cores
% 0.11/0.47 % (lift_lambdas = 0, lambda_to_forall = 0,unroll_only_formulas = 0, sine = GSinE(CountFormulas,hypos,1.5,,3,20000,1.0))
% 0.11/0.47 % SinE strategy is GSinE(CountFormulas,hypos,1.5,,3,20000,1.0)
% 0.11/0.47 % Search class: FGHSF-FFMM22-SFFFFFNN
% 0.11/0.47 % Scheduled 5 strats onto 1 cores with 300 seconds (300 total)
% 0.11/0.47 % Starting SubtermCWHack with 31s (1) cores
% 0.11/0.47 % Preprocessing time : 0.002 s
% 0.11/0.47
% 0.11/0.47 % Proof found!
% 0.11/0.47 % SZS status Unsatisfiable
% 0.11/0.47 % SZS output start CNFRefutation
% See solution above
% 0.32/0.47 % Parsed axioms : 198
% 0.32/0.47 % Removed by relevancy pruning/SinE : 156
% 0.32/0.47 % Initial clauses : 42
% 0.32/0.47 % Removed in clause preprocessing : 0
% 0.32/0.47 % Initial clauses in saturation : 42
% 0.32/0.47 % Processed clauses : 58
% 0.32/0.47 % ...of these trivial : 4
% 0.32/0.47 % ...subsumed : 5
% 0.32/0.47 % ...remaining for further processing : 49
% 0.32/0.47 % Other redundant clauses eliminated : 7
% 0.32/0.47 % Clauses deleted for lack of memory : 0
% 0.32/0.47 % Backward-subsumed : 0
% 0.32/0.47 % Backward-rewritten : 19
% 0.32/0.47 % Generated clauses : 48
% 0.32/0.47 % ...of the previous two non-redundant : 37
% 0.32/0.47 % ...aggressively subsumed : 0
% 0.32/0.47 % Contextual simplify-reflections : 2
% 0.32/0.47 % Paramodulations : 41
% 0.32/0.47 % Factorizations : 0
% 0.32/0.47 % NegExts : 0
% 0.32/0.47 % Equation resolutions : 8
% 0.32/0.47 % Disequality decompositions : 0
% 0.32/0.47 % Total rewrite steps : 82
% 0.32/0.47 % ...of those cached : 74
% 0.32/0.47 % Propositional unsat checks : 0
% 0.32/0.47 % Propositional check models : 0
% 0.32/0.47 % Propositional check unsatisfiable : 0
% 0.32/0.47 % Propositional clauses : 0
% 0.32/0.47 % Propositional clauses after purity: 0
% 0.32/0.47 % Propositional unsat core size : 0
% 0.32/0.47 % Propositional preprocessing time : 0.000
% 0.32/0.47 % Propositional encoding time : 0.000
% 0.32/0.47 % Propositional solver time : 0.000
% 0.32/0.47 % Success case prop preproc time : 0.000
% 0.32/0.47 % Success case prop encoding time : 0.000
% 0.32/0.47 % Success case prop solver time : 0.000
% 0.32/0.47 % Current number of processed clauses : 26
% 0.32/0.47 % Positive orientable unit clauses : 8
% 0.32/0.47 % Positive unorientable unit clauses: 0
% 0.32/0.47 % Negative unit clauses : 0
% 0.32/0.47 % Non-unit-clauses : 18
% 0.32/0.47 % Current number of unprocessed clauses: 21
% 0.32/0.47 % ...number of literals in the above : 102
% 0.32/0.47 % Current number of archived formulas : 0
% 0.32/0.47 % Current number of archived clauses : 19
% 0.32/0.47 % Clause-clause subsumption calls (NU) : 119
% 0.32/0.47 % Rec. Clause-clause subsumption calls : 69
% 0.32/0.47 % Non-unit clause-clause subsumptions : 7
% 0.32/0.47 % Unit Clause-clause subsumption calls : 1
% 0.32/0.47 % Rewrite failures with RHS unbound : 0
% 0.32/0.47 % BW rewrite match attempts : 4
% 0.32/0.47 % BW rewrite match successes : 4
% 0.32/0.47 % Condensation attempts : 0
% 0.32/0.47 % Condensation successes : 0
% 0.32/0.47 % Termbank termtop insertions : 3819
% 0.32/0.47 % Search garbage collected termcells : 926
% 0.32/0.47
% 0.32/0.47 % -------------------------------------------------
% 0.32/0.47 % User time : 0.007 s
% 0.32/0.47 % System time : 0.003 s
% 0.32/0.47 % Total time : 0.009 s
% 0.32/0.47 % Maximum resident set size: 4024 pages
% 0.32/0.47
% 0.32/0.47 % -------------------------------------------------
% 0.32/0.47 % User time : 0.012 s
% 0.32/0.47 % System time : 0.007 s
% 0.32/0.47 % Total time : 0.019 s
% 0.32/0.47 % Maximum resident set size: 4864 pages
% 0.32/0.47 % E exiting
%------------------------------------------------------------------------------