%------------------------------------------------------------------------------
% File : E---3.5.1
% Problem : SWC082-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 : n007.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:55 PM UTC 2026
% Result : Unsatisfiable 0.24s 0.62s
% Output : CNFRefutation 0.24s
% Verified :
% SZS Type : Refutation
% Derivation depth : 4
% Number of leaves : 8
% Syntax : Number of clauses : 28 ( 12 unt; 0 nHn; 28 RR)
% Number of literals : 52 ( 4 equ; 28 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 : 4 ( 0 sgn)
% Comments :
%------------------------------------------------------------------------------
cnf(co1_8,negated_conjecture,
( ~ segmentP(sk1,X1)
| ~ segmentP(sk2,X1)
| ~ neq(X1,nil)
| ~ ssList(X1) ),
file('/export/starexec/sandbox/benchmark/theBenchmark.p',co1_8) ).
cnf(co1_11,negated_conjecture,
( ~ neq(sk4,nil)
| neq(sk5,nil) ),
file('/export/starexec/sandbox/benchmark/theBenchmark.p',co1_11) ).
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,
( ~ neq(sk4,nil)
| segmentP(sk3,sk5) ),
file('/export/starexec/sandbox/benchmark/theBenchmark.p',co1_13) ).
cnf(co1_12,negated_conjecture,
( ~ neq(sk4,nil)
| segmentP(sk4,sk5) ),
file('/export/starexec/sandbox/benchmark/theBenchmark.p',co1_12) ).
cnf(co1_10,negated_conjecture,
( ~ neq(sk4,nil)
| ssList(sk5) ),
file('/export/starexec/sandbox/benchmark/theBenchmark.p',co1_10) ).
cnf(co1_6,negated_conjecture,
sk1 = sk3,
file('/export/starexec/sandbox/benchmark/theBenchmark.p',co1_6) ).
cnf(c_0_8,negated_conjecture,
( ~ segmentP(sk1,X1)
| ~ segmentP(sk2,X1)
| ~ neq(X1,nil)
| ~ ssList(X1) ),
inference(fof_simplification,[status(thm)],[co1_8]) ).
cnf(c_0_9,negated_conjecture,
( ~ neq(sk4,nil)
| neq(sk5,nil) ),
inference(fof_simplification,[status(thm)],[co1_11]) ).
cnf(c_0_10,negated_conjecture,
neq(sk2,nil),
co1_7 ).
cnf(c_0_11,negated_conjecture,
sk2 = sk4,
co1_5 ).
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(sk4,nil)
| segmentP(sk4,sk5) ),
inference(fof_simplification,[status(thm)],[co1_12]) ).
cnf(c_0_14,negated_conjecture,
( ~ neq(sk4,nil)
| ssList(sk5) ),
inference(fof_simplification,[status(thm)],[co1_10]) ).
cnf(c_0_15,negated_conjecture,
( ~ segmentP(sk1,X1)
| ~ segmentP(sk2,X1)
| ~ neq(X1,nil)
| ~ ssList(X1) ),
c_0_8 ).
cnf(c_0_16,negated_conjecture,
sk1 = sk3,
co1_6 ).
cnf(c_0_17,negated_conjecture,
( ~ neq(sk4,nil)
| neq(sk5,nil) ),
c_0_9 ).
cnf(c_0_18,negated_conjecture,
neq(sk4,nil),
inference(rw,[status(thm)],[c_0_10,c_0_11]) ).
cnf(c_0_19,negated_conjecture,
( ~ neq(sk4,nil)
| segmentP(sk3,sk5) ),
c_0_12 ).
cnf(c_0_20,negated_conjecture,
( ~ neq(sk4,nil)
| segmentP(sk4,sk5) ),
c_0_13 ).
cnf(c_0_21,negated_conjecture,
( ~ neq(sk4,nil)
| ssList(sk5) ),
c_0_14 ).
cnf(c_0_22,negated_conjecture,
( ~ ssList(X1)
| ~ segmentP(sk4,X1)
| ~ segmentP(sk3,X1)
| ~ neq(X1,nil) ),
inference(rw,[status(thm)],[inference(rw,[status(thm)],[c_0_15,c_0_16]),c_0_11]) ).
cnf(c_0_23,negated_conjecture,
neq(sk5,nil),
inference(cn,[status(thm)],[inference(rw,[status(thm)],[c_0_17,c_0_18])]) ).
cnf(c_0_24,negated_conjecture,
segmentP(sk3,sk5),
inference(cn,[status(thm)],[inference(rw,[status(thm)],[c_0_19,c_0_18])]) ).
cnf(c_0_25,negated_conjecture,
segmentP(sk4,sk5),
inference(cn,[status(thm)],[inference(rw,[status(thm)],[c_0_20,c_0_18])]) ).
cnf(c_0_26,negated_conjecture,
ssList(sk5),
inference(cn,[status(thm)],[inference(rw,[status(thm)],[c_0_21,c_0_18])]) ).
cnf(c_0_27,negated_conjecture,
$false,
inference(cn,[status(thm)],[inference(rw,[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]),c_0_26])]),
[proof] ).
%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.00/0.05 % Problem : SWC082-1 : TPTP v9.3.1. Released v2.4.0.
% 0.00/0.08 % Command : run_E /export/starexec/sandbox/benchmark/theBenchmark.p 300 THM
% 0.20/0.47 % Computer : n007.cluster.edu
% 0.20/0.47 % Model : x86_64 x86_64
% 0.20/0.47 % CPU : Intel(R) Xeon(R) CPU E5-2620 v4 @ 2.10GHz
% 0.20/0.47 % Memory : 8046.5625MB
% 0.20/0.47 % OS : Linux 6.8.0-71-generic
% 0.20/0.47 % CPULimit : 300
% 0.20/0.47 % WCLimit : 300
% 0.20/0.47 % DateTime : Mon Sep 21 07:52:21 UTC 2026
% 0.20/0.47 % CPUTime :
% 0.20/0.47 Running run_E /export/starexec/sandbox/benchmark/theBenchmark.p 300 THM
% 0.24/0.56 Running first-order theorem proving
% 0.24/0.56 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.24/0.62 % Version: 3.5.1
% 0.24/0.62 % Preprocessing class: FSLSSMSMSSSNFFN.
% 0.24/0.62 % Scheduled 4 strats onto 8 cores with 300 seconds (2400 total)
% 0.24/0.62 % Starting C07_19_nc_SOS_SAT001_MinMin_p005000_rr with 1500s (5) cores
% 0.24/0.62 % Starting new_bool_3 with 300s (1) cores
% 0.24/0.62 % Starting new_bool_1 with 300s (1) cores
% 0.24/0.62 % Starting sh5l with 300s (1) cores
% 0.24/0.62 % new_bool_3 with pid 578540 completed with status 0
% 0.24/0.62 % Result found by new_bool_3
% 0.24/0.62 % Preprocessing class: FSLSSMSMSSSNFFN.
% 0.24/0.62 % Scheduled 4 strats onto 8 cores with 300 seconds (2400 total)
% 0.24/0.62 % Starting C07_19_nc_SOS_SAT001_MinMin_p005000_rr with 1500s (5) cores
% 0.24/0.62 % Starting new_bool_3 with 300s (1) cores
% 0.24/0.62 % (lift_lambdas = 0, lambda_to_forall = 0,unroll_only_formulas = 0, sine = GSinE(CountFormulas,hypos,1.5,,3,20000,1.0))
% 0.24/0.62 % SinE strategy is GSinE(CountFormulas,hypos,1.5,,3,20000,1.0)
% 0.24/0.62 % Search class: FGHSF-FFMM22-SFFFFFNN
% 0.24/0.62 % Scheduled 5 strats onto 1 cores with 300 seconds (300 total)
% 0.24/0.62 % Starting SubtermCWHack with 31s (1) cores
% 0.24/0.62 % SubtermCWHack with pid 578543 completed with status 0
% 0.24/0.62 % Result found by SubtermCWHack
% 0.24/0.62 % Preprocessing class: FSLSSMSMSSSNFFN.
% 0.24/0.62 % Scheduled 4 strats onto 8 cores with 300 seconds (2400 total)
% 0.24/0.62 % Starting C07_19_nc_SOS_SAT001_MinMin_p005000_rr with 1500s (5) cores
% 0.24/0.62 % Starting new_bool_3 with 300s (1) cores
% 0.24/0.62 % (lift_lambdas = 0, lambda_to_forall = 0,unroll_only_formulas = 0, sine = GSinE(CountFormulas,hypos,1.5,,3,20000,1.0))
% 0.24/0.62 % SinE strategy is GSinE(CountFormulas,hypos,1.5,,3,20000,1.0)
% 0.24/0.62 % Search class: FGHSF-FFMM22-SFFFFFNN
% 0.24/0.62 % Scheduled 5 strats onto 1 cores with 300 seconds (300 total)
% 0.24/0.62 % Starting SubtermCWHack with 31s (1) cores
% 0.24/0.62 % Preprocessing time : 0.003 s
% 0.24/0.62
% 0.24/0.62 % Proof found!
% 0.24/0.62 % SZS status Unsatisfiable
% 0.24/0.62 % SZS output start CNFRefutation
% See solution above
% 0.24/0.62 % Parsed axioms : 198
% 0.24/0.62 % Removed by relevancy pruning/SinE : 156
% 0.24/0.62 % Initial clauses : 42
% 0.24/0.62 % Removed in clause preprocessing : 0
% 0.24/0.62 % Initial clauses in saturation : 42
% 0.24/0.62 % Processed clauses : 39
% 0.24/0.62 % ...of these trivial : 0
% 0.24/0.62 % ...subsumed : 0
% 0.24/0.62 % ...remaining for further processing : 39
% 0.24/0.62 % Other redundant clauses eliminated : 5
% 0.24/0.62 % Clauses deleted for lack of memory : 0
% 0.24/0.62 % Backward-subsumed : 6
% 0.24/0.62 % Backward-rewritten : 2
% 0.24/0.62 % Generated clauses : 21
% 0.24/0.62 % ...of the previous two non-redundant : 10
% 0.24/0.62 % ...aggressively subsumed : 0
% 0.24/0.62 % Contextual simplify-reflections : 0
% 0.24/0.62 % Paramodulations : 17
% 0.24/0.62 % Factorizations : 0
% 0.24/0.62 % NegExts : 0
% 0.24/0.62 % Equation resolutions : 5
% 0.24/0.62 % Disequality decompositions : 0
% 0.24/0.62 % Total rewrite steps : 26
% 0.24/0.62 % ...of those cached : 16
% 0.24/0.62 % Propositional unsat checks : 0
% 0.24/0.62 % Propositional check models : 0
% 0.24/0.62 % Propositional check unsatisfiable : 0
% 0.24/0.62 % Propositional clauses : 0
% 0.24/0.62 % Propositional clauses after purity: 0
% 0.24/0.62 % Propositional unsat core size : 0
% 0.24/0.62 % Propositional preprocessing time : 0.000
% 0.24/0.62 % Propositional encoding time : 0.000
% 0.24/0.62 % Propositional solver time : 0.000
% 0.24/0.62 % Success case prop preproc time : 0.000
% 0.24/0.62 % Success case prop encoding time : 0.000
% 0.24/0.62 % Success case prop solver time : 0.000
% 0.24/0.62 % Current number of processed clauses : 27
% 0.24/0.62 % Positive orientable unit clauses : 12
% 0.24/0.62 % Positive unorientable unit clauses: 0
% 0.24/0.62 % Negative unit clauses : 1
% 0.24/0.62 % Non-unit-clauses : 14
% 0.24/0.62 % Current number of unprocessed clauses: 13
% 0.24/0.62 % ...number of literals in the above : 64
% 0.24/0.62 % Current number of archived formulas : 0
% 0.24/0.62 % Current number of archived clauses : 8
% 0.24/0.62 % Clause-clause subsumption calls (NU) : 39
% 0.24/0.62 % Rec. Clause-clause subsumption calls : 21
% 0.24/0.62 % Non-unit clause-clause subsumptions : 0
% 0.24/0.62 % Unit Clause-clause subsumption calls : 6
% 0.24/0.62 % Rewrite failures with RHS unbound : 0
% 0.24/0.62 % BW rewrite match attempts : 2
% 0.24/0.62 % BW rewrite match successes : 2
% 0.24/0.62 % Condensation attempts : 0
% 0.24/0.62 % Condensation successes : 0
% 0.24/0.62 % Termbank termtop insertions : 3321
% 0.24/0.62 % Search garbage collected termcells : 920
% 0.24/0.62
% 0.24/0.62 % -------------------------------------------------
% 0.24/0.62 % User time : 0.007 s
% 0.24/0.62 % System time : 0.006 s
% 0.24/0.62 % Total time : 0.012 s
% 0.24/0.62 % Maximum resident set size: 4068 pages
% 0.24/0.62
% 0.24/0.62 % -------------------------------------------------
% 0.24/0.62 % User time : 0.013 s
% 0.24/0.62 % System time : 0.014 s
% 0.24/0.62 % Total time : 0.027 s
% 0.24/0.62 % Maximum resident set size: 4864 pages
% 0.24/0.62 % E exiting
%------------------------------------------------------------------------------