%------------------------------------------------------------------------------
% File : E---3.5.1
% Problem : SWC080-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 : n006.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:54 PM UTC 2026
% Result : Unsatisfiable 1.74s 0.66s
% Output : CNFRefutation 1.74s
% Verified :
% SZS Type : Refutation
% Derivation depth : 7
% Number of leaves : 15
% Syntax : Number of clauses : 49 ( 19 unt; 1 nHn; 47 RR)
% Number of literals : 117 ( 14 equ; 73 neg)
% Maximal clause size : 6 ( 2 avg)
% Maximal term depth : 3 ( 1 avg)
% Number of predicates : 6 ( 4 usr; 1 prp; 0-2 aty)
% Number of functors : 8 ( 8 usr; 6 con; 0-2 aty)
% Number of variables : 36 ( 4 sgn)
% Comments :
%------------------------------------------------------------------------------
cnf(clause173,axiom,
( ~ ssList(X4)
| ~ ssList(X2)
| ~ ssList(X1)
| ~ ssList(X3)
| app(app(X1,X2),X3) != X4
| segmentP(X4,X2) ),
file('/export/starexec/sandbox2/benchmark/Axioms/SWC001-0.ax',clause173) ).
cnf(clause74,axiom,
( ~ ssList(X1)
| app(nil,X1) = X1 ),
file('/export/starexec/sandbox2/benchmark/Axioms/SWC001-0.ax',clause74) ).
cnf(co1_14,negated_conjecture,
( ~ neq(sk4,nil)
| ~ segmentP(sk1,X1)
| ~ segmentP(sk2,X1)
| ~ neq(X1,nil)
| ~ ssList(X1) ),
file('/export/starexec/sandbox2/benchmark/theBenchmark.p',co1_14) ).
cnf(co1_7,negated_conjecture,
( neq(sk2,nil)
| neq(sk2,nil) ),
file('/export/starexec/sandbox2/benchmark/theBenchmark.p',co1_7) ).
cnf(clause8,axiom,
ssList(nil),
file('/export/starexec/sandbox2/benchmark/Axioms/SWC001-0.ax',clause8) ).
cnf(clause132,axiom,
( ~ ssList(X1)
| ~ ssList(X2)
| ~ frontsegP(X1,X2)
| app(X2,skaf45(X1,X2)) = X1 ),
file('/export/starexec/sandbox2/benchmark/Axioms/SWC001-0.ax',clause132) ).
cnf(co1_5,negated_conjecture,
sk2 = sk4,
file('/export/starexec/sandbox2/benchmark/theBenchmark.p',co1_5) ).
cnf(clause51,axiom,
ssList(skaf45(X1,X2)),
file('/export/starexec/sandbox2/benchmark/Axioms/SWC001-0.ax',clause51) ).
cnf(co1_1,negated_conjecture,
ssList(sk1),
file('/export/starexec/sandbox2/benchmark/theBenchmark.p',co1_1) ).
cnf(co1_16,negated_conjecture,
( ~ neq(sk4,nil)
| neq(sk5,nil) ),
file('/export/starexec/sandbox2/benchmark/theBenchmark.p',co1_16) ).
cnf(co1_18,negated_conjecture,
( ~ neq(sk4,nil)
| frontsegP(sk3,sk5) ),
file('/export/starexec/sandbox2/benchmark/theBenchmark.p',co1_18) ).
cnf(co1_17,negated_conjecture,
( ~ neq(sk4,nil)
| frontsegP(sk4,sk5) ),
file('/export/starexec/sandbox2/benchmark/theBenchmark.p',co1_17) ).
cnf(co1_15,negated_conjecture,
( ~ neq(sk4,nil)
| ssList(sk5) ),
file('/export/starexec/sandbox2/benchmark/theBenchmark.p',co1_15) ).
cnf(co1_2,negated_conjecture,
ssList(sk2),
file('/export/starexec/sandbox2/benchmark/theBenchmark.p',co1_2) ).
cnf(co1_6,negated_conjecture,
sk1 = sk3,
file('/export/starexec/sandbox2/benchmark/theBenchmark.p',co1_6) ).
cnf(c_0_15,plain,
( ~ ssList(X4)
| ~ ssList(X2)
| ~ ssList(X1)
| ~ ssList(X3)
| app(app(X1,X2),X3) != X4
| segmentP(X4,X2) ),
inference(fof_simplification,[status(thm)],[clause173]) ).
cnf(c_0_16,plain,
( ~ ssList(X1)
| app(nil,X1) = X1 ),
inference(fof_simplification,[status(thm)],[clause74]) ).
cnf(c_0_17,negated_conjecture,
( ~ neq(sk4,nil)
| ~ segmentP(sk1,X1)
| ~ segmentP(sk2,X1)
| ~ neq(X1,nil)
| ~ ssList(X1) ),
inference(fof_simplification,[status(thm)],[co1_14]) ).
cnf(c_0_18,negated_conjecture,
neq(sk2,nil),
inference(fof_simplification,[status(thm)],[co1_7]) ).
cnf(c_0_19,plain,
( ~ ssList(X4)
| ~ ssList(X2)
| ~ ssList(X1)
| ~ ssList(X3)
| app(app(X1,X2),X3) != X4
| segmentP(X4,X2) ),
c_0_15 ).
cnf(c_0_20,plain,
( ~ ssList(X1)
| app(nil,X1) = X1 ),
c_0_16 ).
cnf(c_0_21,axiom,
ssList(nil),
clause8 ).
cnf(c_0_22,plain,
( ~ ssList(X1)
| ~ ssList(X2)
| ~ frontsegP(X1,X2)
| app(X2,skaf45(X1,X2)) = X1 ),
inference(fof_simplification,[status(thm)],[clause132]) ).
cnf(c_0_23,negated_conjecture,
( ~ neq(sk4,nil)
| ~ segmentP(sk1,X1)
| ~ segmentP(sk2,X1)
| ~ neq(X1,nil)
| ~ ssList(X1) ),
c_0_17 ).
cnf(c_0_24,negated_conjecture,
sk2 = sk4,
co1_5 ).
cnf(c_0_25,negated_conjecture,
neq(sk2,nil),
c_0_18 ).
cnf(c_0_26,plain,
( ~ ssList(X2)
| ~ ssList(X3)
| ~ ssList(X1)
| app(X2,X3) != X1
| segmentP(X1,X2) ),
inference(cn,[status(thm)],[inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_19,c_0_20]),c_0_21])]) ).
cnf(c_0_27,plain,
( ~ ssList(X1)
| ~ ssList(X2)
| ~ frontsegP(X1,X2)
| app(X2,skaf45(X1,X2)) = X1 ),
c_0_22 ).
cnf(c_0_28,axiom,
ssList(skaf45(X1,X2)),
clause51 ).
cnf(c_0_29,negated_conjecture,
( ~ ssList(X1)
| ~ segmentP(sk2,X1)
| ~ segmentP(sk1,X1)
| ~ neq(X1,nil) ),
inference(cn,[status(thm)],[inference(rw,[status(thm)],[inference(rw,[status(thm)],[c_0_23,c_0_24]),c_0_25])]) ).
cnf(c_0_30,plain,
( ~ ssList(X2)
| ~ ssList(X1)
| ~ frontsegP(X1,X2)
| segmentP(X1,X2) ),
inference(er,[status(thm)],[inference(cn,[status(thm)],[inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_26,c_0_27]),c_0_28])])]) ).
cnf(c_0_31,negated_conjecture,
ssList(sk1),
co1_1 ).
cnf(c_0_32,negated_conjecture,
( ~ neq(sk4,nil)
| neq(sk5,nil) ),
inference(fof_simplification,[status(thm)],[co1_16]) ).
cnf(c_0_33,negated_conjecture,
( ~ neq(sk4,nil)
| frontsegP(sk3,sk5) ),
inference(fof_simplification,[status(thm)],[co1_18]) ).
cnf(c_0_34,negated_conjecture,
( ~ neq(sk4,nil)
| frontsegP(sk4,sk5) ),
inference(fof_simplification,[status(thm)],[co1_17]) ).
cnf(c_0_35,negated_conjecture,
( ~ neq(sk4,nil)
| ssList(sk5) ),
inference(fof_simplification,[status(thm)],[co1_15]) ).
cnf(c_0_36,negated_conjecture,
( ~ ssList(X1)
| ~ segmentP(sk2,X1)
| ~ frontsegP(sk1,X1)
| ~ neq(X1,nil) ),
inference(cn,[status(thm)],[inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_29,c_0_30]),c_0_31])]) ).
cnf(c_0_37,negated_conjecture,
ssList(sk2),
co1_2 ).
cnf(c_0_38,negated_conjecture,
( ~ neq(sk4,nil)
| neq(sk5,nil) ),
c_0_32 ).
cnf(c_0_39,negated_conjecture,
( ~ neq(sk4,nil)
| frontsegP(sk3,sk5) ),
c_0_33 ).
cnf(c_0_40,negated_conjecture,
sk1 = sk3,
co1_6 ).
cnf(c_0_41,negated_conjecture,
( ~ neq(sk4,nil)
| frontsegP(sk4,sk5) ),
c_0_34 ).
cnf(c_0_42,negated_conjecture,
( ~ neq(sk4,nil)
| ssList(sk5) ),
c_0_35 ).
cnf(c_0_43,negated_conjecture,
( ~ ssList(X1)
| ~ frontsegP(sk2,X1)
| ~ frontsegP(sk1,X1)
| ~ neq(X1,nil) ),
inference(cn,[status(thm)],[inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_36,c_0_30]),c_0_37])]) ).
cnf(c_0_44,negated_conjecture,
neq(sk5,nil),
inference(cn,[status(thm)],[inference(rw,[status(thm)],[inference(rw,[status(thm)],[c_0_38,c_0_24]),c_0_25])]) ).
cnf(c_0_45,negated_conjecture,
frontsegP(sk1,sk5),
inference(cn,[status(thm)],[inference(rw,[status(thm)],[inference(rw,[status(thm)],[inference(rw,[status(thm)],[c_0_39,c_0_40]),c_0_24]),c_0_25])]) ).
cnf(c_0_46,negated_conjecture,
frontsegP(sk2,sk5),
inference(cn,[status(thm)],[inference(rw,[status(thm)],[inference(rw,[status(thm)],[inference(rw,[status(thm)],[c_0_41,c_0_24]),c_0_24]),c_0_25])]) ).
cnf(c_0_47,negated_conjecture,
ssList(sk5),
inference(cn,[status(thm)],[inference(rw,[status(thm)],[inference(rw,[status(thm)],[c_0_42,c_0_24]),c_0_25])]) ).
cnf(c_0_48,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_43,c_0_44]),c_0_45]),c_0_46]),c_0_47])]),
[proof] ).
%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.00/0.03 % Problem : SWC080-1 : TPTP v9.3.1. Released v2.4.0.
% 0.00/0.05 % Command : run_E /export/starexec/sandbox2/benchmark/theBenchmark.p 300 THM
% 0.09/0.36 % Computer : n006.cluster.edu
% 0.09/0.36 % Model : x86_64 x86_64
% 0.09/0.36 % CPU : Intel(R) Xeon(R) CPU E5-2620 v4 @ 2.10GHz
% 0.09/0.36 % Memory : 8046.5625MB
% 0.09/0.36 % OS : Linux 6.8.0-71-generic
% 0.09/0.36 % CPULimit : 300
% 0.09/0.36 % WCLimit : 300
% 0.09/0.36 % DateTime : Mon Sep 21 07:53:27 UTC 2026
% 0.09/0.36 % CPUTime :
% 0.09/0.36 Running run_E /export/starexec/sandbox2/benchmark/theBenchmark.p 300 THM
% 0.09/0.40 Running first-order theorem proving
% 0.09/0.40 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
% 1.33/0.66 % Version: 3.5.1
% 1.33/0.66 % Preprocessing class: FSLSSMSMSSSNFFN.
% 1.33/0.66 % Scheduled 4 strats onto 8 cores with 300 seconds (2400 total)
% 1.33/0.66 % Starting C07_19_nc_SOS_SAT001_MinMin_p005000_rr with 1500s (5) cores
% 1.33/0.66 % Starting new_bool_3 with 300s (1) cores
% 1.33/0.66 % Starting new_bool_1 with 300s (1) cores
% 1.33/0.66 % Starting sh5l with 300s (1) cores
% 1.33/0.66 % C07_19_nc_SOS_SAT001_MinMin_p005000_rr with pid 2358404 completed with status 0
% 1.33/0.66 % Result found by C07_19_nc_SOS_SAT001_MinMin_p005000_rr
% 1.33/0.66 % Preprocessing class: FSLSSMSMSSSNFFN.
% 1.33/0.66 % Scheduled 4 strats onto 8 cores with 300 seconds (2400 total)
% 1.33/0.66 % Starting C07_19_nc_SOS_SAT001_MinMin_p005000_rr with 1500s (5) cores
% 1.33/0.66 % (lift_lambdas = 1, lambda_to_forall = 1,unroll_only_formulas = 1, sine = Auto)
% 1.33/0.66 % No SInE strategy applied
% 1.33/0.66 % Search class: FGHSM-FSLM21-MFFFFFNN
% 1.33/0.66 % Scheduled 10 strats onto 5 cores with 1500 seconds (1500 total)
% 1.33/0.66 % Starting SubtermCWHack with 136s (1) cores
% 1.33/0.66 % Starting C07_19_nc_SOS_SAT001_MinMin_p005000_rr with 151s (1) cores
% 1.33/0.66 % Starting G-E--_107_C45_F1_PI_AE_Q7_CS_SP_PS_S0Y with 136s (1) cores
% 1.33/0.66 % Starting G-E--_200_B02_F1_SE_CS_SP_PI_S2k with 136s (1) cores
% 1.74/0.66 % Starting G-E--_301_C18_F1_URBAN_S5PRR_RG_S04BN with 136s (1) cores
% 1.74/0.66 % G-E--_107_C45_F1_PI_AE_Q7_CS_SP_PS_S0Y with pid 2358412 completed with status 0
% 1.74/0.66 % Result found by G-E--_107_C45_F1_PI_AE_Q7_CS_SP_PS_S0Y
% 1.74/0.66 % Preprocessing class: FSLSSMSMSSSNFFN.
% 1.74/0.66 % Scheduled 4 strats onto 8 cores with 300 seconds (2400 total)
% 1.74/0.66 % Starting C07_19_nc_SOS_SAT001_MinMin_p005000_rr with 1500s (5) cores
% 1.74/0.66 % (lift_lambdas = 1, lambda_to_forall = 1,unroll_only_formulas = 1, sine = Auto)
% 1.74/0.66 % No SInE strategy applied
% 1.74/0.66 % Search class: FGHSM-FSLM21-MFFFFFNN
% 1.74/0.66 % Scheduled 10 strats onto 5 cores with 1500 seconds (1500 total)
% 1.74/0.66 % Starting SubtermCWHack with 136s (1) cores
% 1.74/0.66 % Starting C07_19_nc_SOS_SAT001_MinMin_p005000_rr with 151s (1) cores
% 1.74/0.66 % Starting G-E--_107_C45_F1_PI_AE_Q7_CS_SP_PS_S0Y with 136s (1) cores
% 1.74/0.66 % Preprocessing time : 0.006 s
% 1.74/0.66 % Presaturation interreduction done
% 1.74/0.66
% 1.74/0.66 % Proof found!
% 1.74/0.66 % SZS status Unsatisfiable
% 1.74/0.66 % SZS output start CNFRefutation
% See solution above
% 1.74/0.66 % Parsed axioms : 203
% 1.74/0.66 % Removed by relevancy pruning/SinE : 0
% 1.74/0.66 % Initial clauses : 203
% 1.74/0.66 % Removed in clause preprocessing : 0
% 1.74/0.66 % Initial clauses in saturation : 203
% 1.74/0.66 % Processed clauses : 1504
% 1.74/0.66 % ...of these trivial : 62
% 1.74/0.66 % ...subsumed : 614
% 1.74/0.66 % ...remaining for further processing : 828
% 1.74/0.66 % Other redundant clauses eliminated : 241
% 1.74/0.66 % Clauses deleted for lack of memory : 0
% 1.74/0.66 % Backward-subsumed : 76
% 1.74/0.66 % Backward-rewritten : 118
% 1.74/0.66 % Generated clauses : 5175
% 1.74/0.66 % ...of the previous two non-redundant : 4626
% 1.74/0.66 % ...aggressively subsumed : 0
% 1.74/0.66 % Contextual simplify-reflections : 68
% 1.74/0.66 % Paramodulations : 4854
% 1.74/0.66 % Factorizations : 0
% 1.74/0.66 % NegExts : 0
% 1.74/0.66 % Equation resolutions : 284
% 1.74/0.66 % Disequality decompositions : 0
% 1.74/0.66 % Total rewrite steps : 3366
% 1.74/0.66 % ...of those cached : 3152
% 1.74/0.66 % Propositional unsat checks : 0
% 1.74/0.66 % Propositional check models : 0
% 1.74/0.66 % Propositional check unsatisfiable : 0
% 1.74/0.66 % Propositional clauses : 0
% 1.74/0.66 % Propositional clauses after purity: 0
% 1.74/0.66 % Propositional unsat core size : 0
% 1.74/0.66 % Propositional preprocessing time : 0.000
% 1.74/0.66 % Propositional encoding time : 0.000
% 1.74/0.66 % Propositional solver time : 0.000
% 1.74/0.66 % Success case prop preproc time : 0.000
% 1.74/0.66 % Success case prop encoding time : 0.000
% 1.74/0.66 % Success case prop solver time : 0.000
% 1.74/0.66 % Current number of processed clauses : 406
% 1.74/0.66 % Positive orientable unit clauses : 72
% 1.74/0.66 % Positive unorientable unit clauses: 0
% 1.74/0.66 % Negative unit clauses : 29
% 1.74/0.66 % Non-unit-clauses : 305
% 1.74/0.66 % Current number of unprocessed clauses: 3353
% 1.74/0.66 % ...number of literals in the above : 21525
% 1.74/0.66 % Current number of archived formulas : 0
% 1.74/0.66 % Current number of archived clauses : 412
% 1.74/0.66 % Clause-clause subsumption calls (NU) : 45327
% 1.74/0.66 % Rec. Clause-clause subsumption calls : 10139
% 1.74/0.66 % Non-unit clause-clause subsumptions : 585
% 1.74/0.66 % Unit Clause-clause subsumption calls : 2633
% 1.74/0.66 % Rewrite failures with RHS unbound : 0
% 1.74/0.66 % BW rewrite match attempts : 35
% 1.74/0.66 % BW rewrite match successes : 30
% 1.74/0.66 % Condensation attempts : 0
% 1.74/0.66 % Condensation successes : 0
% 1.74/0.66 % Termbank termtop insertions : 93684
% 1.74/0.66 % Search garbage collected termcells : 548
% 1.74/0.66
% 1.74/0.66 % -------------------------------------------------
% 1.74/0.66 % User time : 0.212 s
% 1.74/0.66 % System time : 0.014 s
% 1.74/0.66 % Total time : 0.226 s
% 1.74/0.66 % Maximum resident set size: 3812 pages
% 1.74/0.66
% 1.74/0.66 % -------------------------------------------------
% 1.74/0.66 % User time : 0.900 s
% 1.74/0.66 % System time : 0.050 s
% 1.74/0.66 % Total time : 0.950 s
% 1.74/0.66 % Maximum resident set size: 5120 pages
% 1.74/0.66 % E exiting
%------------------------------------------------------------------------------