%------------------------------------------------------------------------------
% File : E---3.5.1
% Problem : SWC112-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 : n003.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:03 PM UTC 2026
% Result : Unsatisfiable 0.24s 0.54s
% Output : CNFRefutation 0.24s
% Verified :
% SZS Type : Refutation
% Derivation depth : 10
% Number of leaves : 17
% Syntax : Number of clauses : 59 ( 19 unt; 3 nHn; 59 RR)
% Number of literals : 138 ( 50 equ; 83 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 : 8 ( 8 usr; 7 con; 0-2 aty)
% Number of variables : 44 ( 0 sgn)
% Comments :
%------------------------------------------------------------------------------
cnf(clause119,axiom,
( ~ ssList(X1)
| ~ ssList(X2)
| app(X1,X2) != nil
| nil = X2 ),
file('/export/starexec/sandbox/benchmark/Axioms/SWC001-0.ax',clause119) ).
cnf(co1_9,negated_conjecture,
app(app(sk5,sk3),sk6) = sk4,
file('/export/starexec/sandbox/benchmark/theBenchmark.p',co1_9) ).
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_8,negated_conjecture,
ssList(sk6),
file('/export/starexec/sandbox/benchmark/theBenchmark.p',co1_8) ).
cnf(clause85,axiom,
( ~ ssList(X2)
| ~ ssList(X1)
| ssList(app(X2,X1)) ),
file('/export/starexec/sandbox/benchmark/Axioms/SWC001-0.ax',clause85) ).
cnf(co1_7,negated_conjecture,
ssList(sk5),
file('/export/starexec/sandbox/benchmark/theBenchmark.p',co1_7) ).
cnf(co1_1,negated_conjecture,
ssList(sk1),
file('/export/starexec/sandbox/benchmark/theBenchmark.p',co1_1) ).
cnf(co1_13,negated_conjecture,
( nil != sk3
| nil = sk4 ),
file('/export/starexec/sandbox/benchmark/theBenchmark.p',co1_13) ).
cnf(clause73,axiom,
( ~ ssList(X1)
| app(X1,nil) = X1 ),
file('/export/starexec/sandbox/benchmark/Axioms/SWC001-0.ax',clause73) ).
cnf(clause115,axiom,
( ~ ssList(X1)
| ~ ssList(X2)
| ~ neq(X1,X2)
| X1 != X2 ),
file('/export/starexec/sandbox/benchmark/Axioms/SWC001-0.ax',clause115) ).
cnf(co1_16,negated_conjecture,
( nil != sk1
| neq(sk2,nil) ),
file('/export/starexec/sandbox/benchmark/theBenchmark.p',co1_16) ).
cnf(co1_15,negated_conjecture,
( ~ segmentP(sk2,sk1)
| ~ neq(sk1,nil)
| nil = sk2 ),
file('/export/starexec/sandbox/benchmark/theBenchmark.p',co1_15) ).
cnf(clause100,axiom,
( ~ ssList(X2)
| ~ ssList(X1)
| X2 = X1
| neq(X2,X1) ),
file('/export/starexec/sandbox/benchmark/Axioms/SWC001-0.ax',clause100) ).
cnf(clause172,axiom,
( ~ ssList(X1)
| ~ ssList(X2)
| ~ ssList(X4)
| ~ ssList(X3)
| ~ segmentP(X1,X2)
| segmentP(app(app(X4,X1),X3),X2) ),
file('/export/starexec/sandbox/benchmark/Axioms/SWC001-0.ax',clause172) ).
cnf(clause8,axiom,
ssList(nil),
file('/export/starexec/sandbox/benchmark/Axioms/SWC001-0.ax',clause8) ).
cnf(clause57,axiom,
( ~ ssList(X1)
| segmentP(X1,X1) ),
file('/export/starexec/sandbox/benchmark/Axioms/SWC001-0.ax',clause57) ).
cnf(c_0_17,plain,
( ~ ssList(X1)
| ~ ssList(X2)
| app(X1,X2) != nil
| nil = X2 ),
inference(fof_simplification,[status(thm)],[clause119]) ).
cnf(c_0_18,negated_conjecture,
app(app(sk5,sk3),sk6) = sk4,
co1_9 ).
cnf(c_0_19,negated_conjecture,
sk1 = sk3,
co1_6 ).
cnf(c_0_20,negated_conjecture,
sk2 = sk4,
co1_5 ).
cnf(c_0_21,plain,
( ~ ssList(X1)
| ~ ssList(X2)
| app(X1,X2) != nil
| nil = X2 ),
c_0_17 ).
cnf(c_0_22,negated_conjecture,
app(app(sk5,sk1),sk6) = sk2,
inference(rw,[status(thm)],[inference(rw,[status(thm)],[c_0_18,c_0_19]),c_0_20]) ).
cnf(c_0_23,negated_conjecture,
ssList(sk6),
co1_8 ).
cnf(c_0_24,plain,
( ~ ssList(X2)
| ~ ssList(X1)
| ssList(app(X2,X1)) ),
inference(fof_simplification,[status(thm)],[clause85]) ).
cnf(c_0_25,negated_conjecture,
( ~ ssList(app(sk5,sk1))
| sk2 != nil
| sk6 = nil ),
inference(cn,[status(thm)],[inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_21,c_0_22]),c_0_23])]) ).
cnf(c_0_26,plain,
( ~ ssList(X2)
| ~ ssList(X1)
| ssList(app(X2,X1)) ),
c_0_24 ).
cnf(c_0_27,negated_conjecture,
ssList(sk5),
co1_7 ).
cnf(c_0_28,negated_conjecture,
ssList(sk1),
co1_1 ).
cnf(c_0_29,negated_conjecture,
( nil != sk3
| nil = sk4 ),
inference(fof_simplification,[status(thm)],[co1_13]) ).
cnf(c_0_30,plain,
( ~ ssList(X1)
| app(X1,nil) = X1 ),
inference(fof_simplification,[status(thm)],[clause73]) ).
cnf(c_0_31,negated_conjecture,
( sk2 != nil
| sk6 = nil ),
inference(cn,[status(thm)],[inference(rw,[status(thm)],[inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_25,c_0_26]),c_0_27]),c_0_28])]) ).
cnf(c_0_32,plain,
( ~ ssList(X1)
| ~ ssList(X2)
| ~ neq(X1,X2)
| X1 != X2 ),
inference(fof_simplification,[status(thm)],[clause115]) ).
cnf(c_0_33,negated_conjecture,
( nil != sk1
| neq(sk2,nil) ),
inference(fof_simplification,[status(thm)],[co1_16]) ).
cnf(c_0_34,negated_conjecture,
( nil != sk3
| nil = sk4 ),
c_0_29 ).
cnf(c_0_35,plain,
( ~ ssList(X1)
| app(X1,nil) = X1 ),
c_0_30 ).
cnf(c_0_36,negated_conjecture,
( sk2 != nil
| app(app(sk5,sk1),nil) = sk2 ),
inference(spm,[status(thm)],[c_0_22,c_0_31]) ).
cnf(c_0_37,plain,
( ~ ssList(X1)
| ~ ssList(X2)
| ~ neq(X1,X2)
| X1 != X2 ),
c_0_32 ).
cnf(c_0_38,negated_conjecture,
( nil != sk1
| neq(sk2,nil) ),
c_0_33 ).
cnf(c_0_39,negated_conjecture,
( sk1 != nil
| sk2 = nil ),
inference(rw,[status(thm)],[inference(rw,[status(thm)],[c_0_34,c_0_20]),c_0_19]) ).
cnf(c_0_40,negated_conjecture,
( ~ segmentP(sk2,sk1)
| ~ neq(sk1,nil)
| nil = sk2 ),
inference(fof_simplification,[status(thm)],[co1_15]) ).
cnf(c_0_41,plain,
( ~ ssList(X2)
| ~ ssList(X1)
| X2 = X1
| neq(X2,X1) ),
inference(fof_simplification,[status(thm)],[clause100]) ).
cnf(c_0_42,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_43,negated_conjecture,
( ~ ssList(app(sk5,sk1))
| sk2 != nil
| app(sk5,sk1) = sk2 ),
inference(spm,[status(thm)],[c_0_35,c_0_36]) ).
cnf(c_0_44,plain,
( ~ ssList(X1)
| ~ neq(X1,X1) ),
inference(er,[status(thm)],[c_0_37]) ).
cnf(c_0_45,negated_conjecture,
( sk1 != nil
| neq(nil,nil) ),
inference(spm,[status(thm)],[c_0_38,c_0_39]) ).
cnf(c_0_46,axiom,
ssList(nil),
clause8 ).
cnf(c_0_47,negated_conjecture,
( ~ segmentP(sk2,sk1)
| ~ neq(sk1,nil)
| nil = sk2 ),
c_0_40 ).
cnf(c_0_48,plain,
( ~ ssList(X2)
| ~ ssList(X1)
| X2 = X1
| neq(X2,X1) ),
c_0_41 ).
cnf(c_0_49,plain,
( ~ ssList(X1)
| ~ ssList(X2)
| ~ ssList(X4)
| ~ ssList(X3)
| ~ segmentP(X1,X2)
| segmentP(app(app(X4,X1),X3),X2) ),
c_0_42 ).
cnf(c_0_50,negated_conjecture,
( sk2 != nil
| app(sk5,sk1) = sk2 ),
inference(cn,[status(thm)],[inference(rw,[status(thm)],[inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_43,c_0_26]),c_0_27]),c_0_28])]) ).
cnf(c_0_51,negated_conjecture,
sk1 != 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_52,negated_conjecture,
( ~ segmentP(sk2,sk1)
| sk2 = nil ),
inference(csr,[status(thm)],[inference(cn,[status(thm)],[inference(rw,[status(thm)],[inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_47,c_0_48]),c_0_28]),c_0_46])]),c_0_39]) ).
cnf(c_0_53,negated_conjecture,
( ~ ssList(X1)
| ~ segmentP(sk1,X1)
| segmentP(sk2,X1) ),
inference(cn,[status(thm)],[inference(rw,[status(thm)],[inference(rw,[status(thm)],[inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_49,c_0_22]),c_0_27]),c_0_23]),c_0_28])]) ).
cnf(c_0_54,negated_conjecture,
sk2 != nil,
inference(sr,[status(thm)],[inference(cn,[status(thm)],[inference(rw,[status(thm)],[inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_21,c_0_50]),c_0_28]),c_0_27])]),c_0_51]) ).
cnf(c_0_55,plain,
( ~ ssList(X1)
| segmentP(X1,X1) ),
inference(fof_simplification,[status(thm)],[clause57]) ).
cnf(c_0_56,negated_conjecture,
~ segmentP(sk1,sk1),
inference(sr,[status(thm)],[inference(cn,[status(thm)],[inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_52,c_0_53]),c_0_28])]),c_0_54]) ).
cnf(c_0_57,plain,
( ~ ssList(X1)
| segmentP(X1,X1) ),
c_0_55 ).
cnf(c_0_58,negated_conjecture,
$false,
inference(cn,[status(thm)],[inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_56,c_0_57]),c_0_28])]),
[proof] ).
%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.00/0.03 % Problem : SWC112-1 : TPTP v9.3.1. Released v2.4.0.
% 0.00/0.06 % Command : run_E /export/starexec/sandbox/benchmark/theBenchmark.p 300 THM
% 0.18/0.43 % Computer : n003.cluster.edu
% 0.18/0.43 % Model : x86_64 x86_64
% 0.18/0.43 % CPU : Intel(R) Xeon(R) CPU E5-2620 v4 @ 2.10GHz
% 0.18/0.43 % Memory : 8046.5625MB
% 0.18/0.43 % OS : Linux 6.8.0-71-generic
% 0.18/0.43 % CPULimit : 300
% 0.18/0.43 % WCLimit : 300
% 0.18/0.43 % DateTime : Mon Sep 21 07:58:03 UTC 2026
% 0.18/0.44 % CPUTime :
% 0.18/0.44 Running run_E /export/starexec/sandbox/benchmark/theBenchmark.p 300 THM
% 0.18/0.48 Running first-order theorem proving
% 0.18/0.48 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.54 % Version: 3.5.1
% 0.24/0.54 % Preprocessing class: FSLSSMSMSSSNFFN.
% 0.24/0.54 % Scheduled 4 strats onto 8 cores with 300 seconds (2400 total)
% 0.24/0.54 % Starting C07_19_nc_SOS_SAT001_MinMin_p005000_rr with 1500s (5) cores
% 0.24/0.54 % Starting new_bool_3 with 300s (1) cores
% 0.24/0.54 % Starting new_bool_1 with 300s (1) cores
% 0.24/0.54 % Starting sh5l with 300s (1) cores
% 0.24/0.54 % new_bool_1 with pid 3804299 completed with status 0
% 0.24/0.54 % Result found by new_bool_1
% 0.24/0.54 % Preprocessing class: FSLSSMSMSSSNFFN.
% 0.24/0.54 % Scheduled 4 strats onto 8 cores with 300 seconds (2400 total)
% 0.24/0.54 % Starting C07_19_nc_SOS_SAT001_MinMin_p005000_rr with 1500s (5) cores
% 0.24/0.54 % Starting new_bool_3 with 300s (1) cores
% 0.24/0.54 % Starting new_bool_1 with 300s (1) cores
% 0.24/0.54 % (lift_lambdas = 0, lambda_to_forall = 0,unroll_only_formulas = 0, sine = GSinE(CountFormulas,hypos,1.5,,3,20000,1.0))
% 0.24/0.54 % SinE strategy is GSinE(CountFormulas,hypos,1.5,,3,20000,1.0)
% 0.24/0.54 % Search class: FGHSF-FFMM21-MFFFFFNN
% 0.24/0.54 % Scheduled 5 strats onto 1 cores with 300 seconds (300 total)
% 0.24/0.54 % Starting SubtermCWHack with 31s (1) cores
% 0.24/0.54 % SubtermCWHack with pid 3804308 completed with status 0
% 0.24/0.54 % Result found by SubtermCWHack
% 0.24/0.54 % Preprocessing class: FSLSSMSMSSSNFFN.
% 0.24/0.54 % Scheduled 4 strats onto 8 cores with 300 seconds (2400 total)
% 0.24/0.54 % Starting C07_19_nc_SOS_SAT001_MinMin_p005000_rr with 1500s (5) cores
% 0.24/0.54 % Starting new_bool_3 with 300s (1) cores
% 0.24/0.54 % Starting new_bool_1 with 300s (1) cores
% 0.24/0.54 % (lift_lambdas = 0, lambda_to_forall = 0,unroll_only_formulas = 0, sine = GSinE(CountFormulas,hypos,1.5,,3,20000,1.0))
% 0.24/0.54 % SinE strategy is GSinE(CountFormulas,hypos,1.5,,3,20000,1.0)
% 0.24/0.54 % Search class: FGHSF-FFMM21-MFFFFFNN
% 0.24/0.54 % Scheduled 5 strats onto 1 cores with 300 seconds (300 total)
% 0.24/0.54 % Starting SubtermCWHack with 31s (1) cores
% 0.24/0.54 % Preprocessing time : 0.002 s
% 0.24/0.54
% 0.24/0.54 % Proof found!
% 0.24/0.54 % SZS status Unsatisfiable
% 0.24/0.54 % SZS output start CNFRefutation
% See solution above
% 0.24/0.54 % Parsed axioms : 202
% 0.24/0.54 % Removed by relevancy pruning/SinE : 127
% 0.24/0.54 % Initial clauses : 75
% 0.24/0.54 % Removed in clause preprocessing : 0
% 0.24/0.54 % Initial clauses in saturation : 75
% 0.24/0.54 % Processed clauses : 156
% 0.24/0.54 % ...of these trivial : 1
% 0.24/0.54 % ...subsumed : 32
% 0.24/0.54 % ...remaining for further processing : 123
% 0.24/0.54 % Other redundant clauses eliminated : 13
% 0.24/0.54 % Clauses deleted for lack of memory : 0
% 0.24/0.54 % Backward-subsumed : 17
% 0.24/0.54 % Backward-rewritten : 4
% 0.24/0.54 % Generated clauses : 315
% 0.24/0.54 % ...of the previous two non-redundant : 252
% 0.24/0.54 % ...aggressively subsumed : 0
% 0.24/0.54 % Contextual simplify-reflections : 4
% 0.24/0.54 % Paramodulations : 298
% 0.24/0.54 % Factorizations : 0
% 0.24/0.54 % NegExts : 0
% 0.24/0.54 % Equation resolutions : 17
% 0.24/0.54 % Disequality decompositions : 0
% 0.24/0.54 % Total rewrite steps : 274
% 0.24/0.54 % ...of those cached : 265
% 0.24/0.54 % Propositional unsat checks : 0
% 0.24/0.54 % Propositional check models : 0
% 0.24/0.54 % Propositional check unsatisfiable : 0
% 0.24/0.54 % Propositional clauses : 0
% 0.24/0.54 % Propositional clauses after purity: 0
% 0.24/0.54 % Propositional unsat core size : 0
% 0.24/0.54 % Propositional preprocessing time : 0.000
% 0.24/0.54 % Propositional encoding time : 0.000
% 0.24/0.54 % Propositional solver time : 0.000
% 0.24/0.54 % Success case prop preproc time : 0.000
% 0.24/0.54 % Success case prop encoding time : 0.000
% 0.24/0.54 % Success case prop solver time : 0.000
% 0.24/0.54 % Current number of processed clauses : 93
% 0.24/0.54 % Positive orientable unit clauses : 16
% 0.24/0.54 % Positive unorientable unit clauses: 0
% 0.24/0.54 % Negative unit clauses : 5
% 0.24/0.54 % Non-unit-clauses : 72
% 0.24/0.54 % Current number of unprocessed clauses: 151
% 0.24/0.54 % ...number of literals in the above : 829
% 0.24/0.54 % Current number of archived formulas : 0
% 0.24/0.54 % Current number of archived clauses : 22
% 0.24/0.54 % Clause-clause subsumption calls (NU) : 1288
% 0.24/0.54 % Rec. Clause-clause subsumption calls : 444
% 0.24/0.54 % Non-unit clause-clause subsumptions : 40
% 0.24/0.54 % Unit Clause-clause subsumption calls : 85
% 0.24/0.54 % Rewrite failures with RHS unbound : 0
% 0.24/0.54 % BW rewrite match attempts : 3
% 0.24/0.54 % BW rewrite match successes : 3
% 0.24/0.54 % Condensation attempts : 0
% 0.24/0.54 % Condensation successes : 0
% 0.24/0.54 % Termbank termtop insertions : 9586
% 0.24/0.54 % Search garbage collected termcells : 876
% 0.24/0.54
% 0.24/0.54 % -------------------------------------------------
% 0.24/0.54 % User time : 0.012 s
% 0.24/0.54 % System time : 0.004 s
% 0.24/0.54 % Total time : 0.016 s
% 0.24/0.54 % Maximum resident set size: 4072 pages
% 0.24/0.54
% 0.24/0.54 % -------------------------------------------------
% 0.24/0.54 % User time : 0.015 s
% 0.24/0.54 % System time : 0.009 s
% 0.24/0.54 % Total time : 0.024 s
% 0.24/0.54 % Maximum resident set size: 4864 pages
% 0.24/0.54 % E exiting
%------------------------------------------------------------------------------