%------------------------------------------------------------------------------
% File : E---3.5.1
% Problem : SWC092-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 : 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:58 PM UTC 2026
% Result : Unsatisfiable 0.26s 0.61s
% Output : CNFRefutation 0.26s
% Verified :
% SZS Type : Refutation
% Derivation depth : 6
% Number of leaves : 14
% Syntax : Number of clauses : 45 ( 17 unt; 3 nHn; 45 RR)
% Number of literals : 112 ( 25 equ; 73 neg)
% Maximal clause size : 6 ( 2 avg)
% Maximal term depth : 3 ( 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 : 41 ( 0 sgn)
% Comments :
%------------------------------------------------------------------------------
cnf(co1_8,negated_conjecture,
( ~ segmentP(sk1,X1)
| ~ segmentP(sk2,X1)
| ~ neq(X1,nil)
| ~ ssList(X1) ),
file('/export/starexec/sandbox2/benchmark/theBenchmark.p',co1_8) ).
cnf(clause172,axiom,
( ~ ssList(X1)
| ~ ssList(X2)
| ~ ssList(X4)
| ~ ssList(X3)
| ~ segmentP(X1,X2)
| segmentP(app(app(X4,X1),X3),X2) ),
file('/export/starexec/sandbox2/benchmark/Axioms/SWC001-0.ax',clause172) ).
cnf(clause74,axiom,
( ~ ssList(X1)
| app(nil,X1) = X1 ),
file('/export/starexec/sandbox2/benchmark/Axioms/SWC001-0.ax',clause74) ).
cnf(co1_6,negated_conjecture,
sk1 = sk3,
file('/export/starexec/sandbox2/benchmark/theBenchmark.p',co1_6) ).
cnf(co1_5,negated_conjecture,
sk2 = sk4,
file('/export/starexec/sandbox2/benchmark/theBenchmark.p',co1_5) ).
cnf(clause100,axiom,
( ~ ssList(X2)
| ~ ssList(X1)
| X2 = X1
| neq(X2,X1) ),
file('/export/starexec/sandbox2/benchmark/Axioms/SWC001-0.ax',clause100) ).
cnf(clause8,axiom,
ssList(nil),
file('/export/starexec/sandbox2/benchmark/Axioms/SWC001-0.ax',clause8) ).
cnf(clause115,axiom,
( ~ ssList(X1)
| ~ ssList(X2)
| ~ neq(X1,X2)
| X1 != X2 ),
file('/export/starexec/sandbox2/benchmark/Axioms/SWC001-0.ax',clause115) ).
cnf(co1_7,negated_conjecture,
neq(sk2,nil),
file('/export/starexec/sandbox2/benchmark/theBenchmark.p',co1_7) ).
cnf(co1_13,negated_conjecture,
( nil != sk3
| nil = sk4 ),
file('/export/starexec/sandbox2/benchmark/theBenchmark.p',co1_13) ).
cnf(co1_10,negated_conjecture,
app(sk3,sk5) = sk4,
file('/export/starexec/sandbox2/benchmark/theBenchmark.p',co1_10) ).
cnf(co1_9,negated_conjecture,
ssList(sk5),
file('/export/starexec/sandbox2/benchmark/theBenchmark.p',co1_9) ).
cnf(co1_3,negated_conjecture,
ssList(sk3),
file('/export/starexec/sandbox2/benchmark/theBenchmark.p',co1_3) ).
cnf(clause57,axiom,
( ~ ssList(X1)
| segmentP(X1,X1) ),
file('/export/starexec/sandbox2/benchmark/Axioms/SWC001-0.ax',clause57) ).
cnf(c_0_14,negated_conjecture,
( ~ segmentP(sk1,X1)
| ~ segmentP(sk2,X1)
| ~ neq(X1,nil)
| ~ ssList(X1) ),
inference(fof_simplification,[status(thm)],[co1_8]) ).
cnf(c_0_15,plain,
( ~ ssList(X1)
| ~ ssList(X2)
| ~ ssList(X4)
| ~ ssList(X3)
| ~ segmentP(X1,X2)
| segmentP(app(app(X4,X1),X3),X2) ),
inference(fof_simplification,[status(thm)],[clause172]) ).
cnf(c_0_16,plain,
( ~ ssList(X1)
| app(nil,X1) = X1 ),
inference(fof_simplification,[status(thm)],[clause74]) ).
cnf(c_0_17,negated_conjecture,
( ~ segmentP(sk1,X1)
| ~ segmentP(sk2,X1)
| ~ neq(X1,nil)
| ~ ssList(X1) ),
c_0_14 ).
cnf(c_0_18,negated_conjecture,
sk1 = sk3,
co1_6 ).
cnf(c_0_19,negated_conjecture,
sk2 = sk4,
co1_5 ).
cnf(c_0_20,plain,
( ~ ssList(X2)
| ~ ssList(X1)
| X2 = X1
| neq(X2,X1) ),
inference(fof_simplification,[status(thm)],[clause100]) ).
cnf(c_0_21,plain,
( ~ ssList(X1)
| ~ ssList(X2)
| ~ ssList(X4)
| ~ ssList(X3)
| ~ segmentP(X1,X2)
| segmentP(app(app(X4,X1),X3),X2) ),
c_0_15 ).
cnf(c_0_22,plain,
( ~ ssList(X1)
| app(nil,X1) = X1 ),
c_0_16 ).
cnf(c_0_23,axiom,
ssList(nil),
clause8 ).
cnf(c_0_24,plain,
( ~ ssList(X1)
| ~ ssList(X2)
| ~ neq(X1,X2)
| X1 != X2 ),
inference(fof_simplification,[status(thm)],[clause115]) ).
cnf(c_0_25,negated_conjecture,
neq(sk2,nil),
co1_7 ).
cnf(c_0_26,negated_conjecture,
( nil != sk3
| nil = sk4 ),
inference(fof_simplification,[status(thm)],[co1_13]) ).
cnf(c_0_27,negated_conjecture,
( ~ ssList(X1)
| ~ segmentP(sk4,X1)
| ~ segmentP(sk3,X1)
| ~ neq(X1,nil) ),
inference(rw,[status(thm)],[inference(rw,[status(thm)],[c_0_17,c_0_18]),c_0_19]) ).
cnf(c_0_28,plain,
( ~ ssList(X2)
| ~ ssList(X1)
| X2 = X1
| neq(X2,X1) ),
c_0_20 ).
cnf(c_0_29,plain,
( ~ ssList(X1)
| ~ ssList(X3)
| ~ ssList(X2)
| ~ segmentP(X1,X3)
| segmentP(app(X1,X2),X3) ),
inference(cn,[status(thm)],[inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_21,c_0_22]),c_0_23])]) ).
cnf(c_0_30,negated_conjecture,
app(sk3,sk5) = sk4,
co1_10 ).
cnf(c_0_31,negated_conjecture,
ssList(sk5),
co1_9 ).
cnf(c_0_32,negated_conjecture,
ssList(sk3),
co1_3 ).
cnf(c_0_33,plain,
( ~ ssList(X1)
| ~ ssList(X2)
| ~ neq(X1,X2)
| X1 != X2 ),
c_0_24 ).
cnf(c_0_34,negated_conjecture,
neq(sk4,nil),
inference(rw,[status(thm)],[c_0_25,c_0_19]) ).
cnf(c_0_35,negated_conjecture,
( nil != sk3
| nil = sk4 ),
c_0_26 ).
cnf(c_0_36,negated_conjecture,
( ~ ssList(X1)
| ~ segmentP(sk4,X1)
| ~ segmentP(sk3,X1)
| nil = X1 ),
inference(cn,[status(thm)],[inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_27,c_0_28]),c_0_23])]) ).
cnf(c_0_37,negated_conjecture,
( ~ ssList(X1)
| ~ segmentP(sk3,X1)
| segmentP(sk4,X1) ),
inference(cn,[status(thm)],[inference(rw,[status(thm)],[inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_29,c_0_30]),c_0_31]),c_0_32])]) ).
cnf(c_0_38,plain,
( ~ ssList(X1)
| segmentP(X1,X1) ),
inference(fof_simplification,[status(thm)],[clause57]) ).
cnf(c_0_39,plain,
( ~ ssList(X1)
| ~ neq(X1,X1) ),
inference(er,[status(thm)],[c_0_33]) ).
cnf(c_0_40,negated_conjecture,
( sk3 != nil
| neq(nil,nil) ),
inference(spm,[status(thm)],[c_0_34,c_0_35]) ).
cnf(c_0_41,negated_conjecture,
( ~ ssList(X1)
| ~ segmentP(sk3,X1)
| nil = X1 ),
inference(spm,[status(thm)],[c_0_36,c_0_37]) ).
cnf(c_0_42,plain,
( ~ ssList(X1)
| segmentP(X1,X1) ),
c_0_38 ).
cnf(c_0_43,negated_conjecture,
sk3 != nil,
inference(cn,[status(thm)],[inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_39,c_0_40]),c_0_23])]) ).
cnf(c_0_44,negated_conjecture,
$false,
inference(sr,[status(thm)],[inference(cn,[status(thm)],[inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_41,c_0_42]),c_0_32])]),c_0_43]),
[proof] ).
%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.00/0.04 % Problem : SWC092-1 : TPTP v9.3.1. Released v2.4.0.
% 0.00/0.06 % Command : run_E /export/starexec/sandbox2/benchmark/theBenchmark.p 300 THM
% 0.18/0.45 % Computer : n007.cluster.edu
% 0.18/0.45 % Model : x86_64 x86_64
% 0.18/0.45 % CPU : Intel(R) Xeon(R) CPU E5-2620 v4 @ 2.10GHz
% 0.18/0.45 % Memory : 8046.5625MB
% 0.18/0.45 % OS : Linux 6.8.0-71-generic
% 0.18/0.45 % CPULimit : 300
% 0.18/0.45 % WCLimit : 300
% 0.18/0.45 % DateTime : Mon Sep 21 07:53:05 UTC 2026
% 0.18/0.45 % CPUTime :
% 0.18/0.45 Running run_E /export/starexec/sandbox2/benchmark/theBenchmark.p 300 THM
% 0.18/0.51 Running first-order theorem proving
% 0.18/0.51 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.26/0.61 % Version: 3.5.1
% 0.26/0.61 % Preprocessing class: FSLSSMSMSSSNFFN.
% 0.26/0.61 % Scheduled 4 strats onto 8 cores with 300 seconds (2400 total)
% 0.26/0.61 % Starting C07_19_nc_SOS_SAT001_MinMin_p005000_rr with 1500s (5) cores
% 0.26/0.61 % Starting new_bool_3 with 300s (1) cores
% 0.26/0.61 % Starting new_bool_1 with 300s (1) cores
% 0.26/0.61 % Starting sh5l with 300s (1) cores
% 0.26/0.61 % new_bool_1 with pid 580192 completed with status 0
% 0.26/0.61 % Result found by new_bool_1
% 0.26/0.61 % Preprocessing class: FSLSSMSMSSSNFFN.
% 0.26/0.61 % Scheduled 4 strats onto 8 cores with 300 seconds (2400 total)
% 0.26/0.61 % Starting C07_19_nc_SOS_SAT001_MinMin_p005000_rr with 1500s (5) cores
% 0.26/0.61 % Starting new_bool_3 with 300s (1) cores
% 0.26/0.61 % Starting new_bool_1 with 300s (1) cores
% 0.26/0.61 % (lift_lambdas = 0, lambda_to_forall = 0,unroll_only_formulas = 0, sine = GSinE(CountFormulas,hypos,1.5,,3,20000,1.0))
% 0.26/0.61 % SinE strategy is GSinE(CountFormulas,hypos,1.5,,3,20000,1.0)
% 0.26/0.61 % Search class: FGHSF-FFMM21-MFFFFFNN
% 0.26/0.61 % Scheduled 5 strats onto 1 cores with 300 seconds (300 total)
% 0.26/0.61 % Starting SubtermCWHack with 31s (1) cores
% 0.26/0.61 % SubtermCWHack with pid 580200 completed with status 0
% 0.26/0.61 % Result found by SubtermCWHack
% 0.26/0.61 % Preprocessing class: FSLSSMSMSSSNFFN.
% 0.26/0.61 % Scheduled 4 strats onto 8 cores with 300 seconds (2400 total)
% 0.26/0.61 % Starting C07_19_nc_SOS_SAT001_MinMin_p005000_rr with 1500s (5) cores
% 0.26/0.61 % Starting new_bool_3 with 300s (1) cores
% 0.26/0.61 % Starting new_bool_1 with 300s (1) cores
% 0.26/0.61 % (lift_lambdas = 0, lambda_to_forall = 0,unroll_only_formulas = 0, sine = GSinE(CountFormulas,hypos,1.5,,3,20000,1.0))
% 0.26/0.61 % SinE strategy is GSinE(CountFormulas,hypos,1.5,,3,20000,1.0)
% 0.26/0.61 % Search class: FGHSF-FFMM21-MFFFFFNN
% 0.26/0.61 % Scheduled 5 strats onto 1 cores with 300 seconds (300 total)
% 0.26/0.61 % Starting SubtermCWHack with 31s (1) cores
% 0.26/0.61 % Preprocessing time : 0.003 s
% 0.26/0.61
% 0.26/0.61 % Proof found!
% 0.26/0.61 % SZS status Unsatisfiable
% 0.26/0.61 % SZS output start CNFRefutation
% See solution above
% 0.26/0.61 % Parsed axioms : 198
% 0.26/0.61 % Removed by relevancy pruning/SinE : 127
% 0.26/0.61 % Initial clauses : 71
% 0.26/0.61 % Removed in clause preprocessing : 0
% 0.26/0.61 % Initial clauses in saturation : 71
% 0.26/0.61 % Processed clauses : 287
% 0.26/0.61 % ...of these trivial : 7
% 0.26/0.61 % ...subsumed : 99
% 0.26/0.61 % ...remaining for further processing : 181
% 0.26/0.61 % Other redundant clauses eliminated : 16
% 0.26/0.61 % Clauses deleted for lack of memory : 0
% 0.26/0.61 % Backward-subsumed : 16
% 0.26/0.61 % Backward-rewritten : 2
% 0.26/0.61 % Generated clauses : 696
% 0.26/0.61 % ...of the previous two non-redundant : 566
% 0.26/0.61 % ...aggressively subsumed : 0
% 0.26/0.61 % Contextual simplify-reflections : 1
% 0.26/0.61 % Paramodulations : 677
% 0.26/0.61 % Factorizations : 0
% 0.26/0.61 % NegExts : 0
% 0.26/0.61 % Equation resolutions : 20
% 0.26/0.61 % Disequality decompositions : 0
% 0.26/0.61 % Total rewrite steps : 598
% 0.26/0.61 % ...of those cached : 583
% 0.26/0.61 % Propositional unsat checks : 0
% 0.26/0.61 % Propositional check models : 0
% 0.26/0.61 % Propositional check unsatisfiable : 0
% 0.26/0.61 % Propositional clauses : 0
% 0.26/0.61 % Propositional clauses after purity: 0
% 0.26/0.61 % Propositional unsat core size : 0
% 0.26/0.61 % Propositional preprocessing time : 0.000
% 0.26/0.61 % Propositional encoding time : 0.000
% 0.26/0.61 % Propositional solver time : 0.000
% 0.26/0.61 % Success case prop preproc time : 0.000
% 0.26/0.61 % Success case prop encoding time : 0.000
% 0.26/0.61 % Success case prop solver time : 0.000
% 0.26/0.61 % Current number of processed clauses : 153
% 0.26/0.61 % Positive orientable unit clauses : 19
% 0.26/0.61 % Positive unorientable unit clauses: 0
% 0.26/0.61 % Negative unit clauses : 8
% 0.26/0.61 % Non-unit-clauses : 126
% 0.26/0.61 % Current number of unprocessed clauses: 346
% 0.26/0.61 % ...number of literals in the above : 1884
% 0.26/0.61 % Current number of archived formulas : 0
% 0.26/0.61 % Current number of archived clauses : 18
% 0.26/0.61 % Clause-clause subsumption calls (NU) : 3171
% 0.26/0.61 % Rec. Clause-clause subsumption calls : 988
% 0.26/0.61 % Non-unit clause-clause subsumptions : 81
% 0.26/0.61 % Unit Clause-clause subsumption calls : 229
% 0.26/0.61 % Rewrite failures with RHS unbound : 0
% 0.26/0.61 % BW rewrite match attempts : 2
% 0.26/0.61 % BW rewrite match successes : 2
% 0.26/0.61 % Condensation attempts : 0
% 0.26/0.61 % Condensation successes : 0
% 0.26/0.61 % Termbank termtop insertions : 16334
% 0.26/0.61 % Search garbage collected termcells : 864
% 0.26/0.61
% 0.26/0.61 % -------------------------------------------------
% 0.26/0.61 % User time : 0.035 s
% 0.26/0.61 % System time : 0.009 s
% 0.26/0.61 % Total time : 0.044 s
% 0.26/0.61 % Maximum resident set size: 4016 pages
% 0.26/0.61
% 0.26/0.61 % -------------------------------------------------
% 0.26/0.61 % User time : 0.041 s
% 0.26/0.61 % System time : 0.017 s
% 0.26/0.61 % Total time : 0.058 s
% 0.26/0.61 % Maximum resident set size: 5120 pages
% 0.26/0.61 % E exiting
%------------------------------------------------------------------------------