%------------------------------------------------------------------------------
% File : E-SAT---3.5.1
% Problem : SWC123-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 : n011.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:45:02 PM UTC 2026
% Result : Unsatisfiable 9.76s 1.86s
% Output : CNFRefutation 9.76s
% Verified :
% SZS Type : Refutation
% Derivation depth : 20
% Number of leaves : 36
% Syntax : Number of clauses : 132 ( 33 unt; 31 nHn; 111 RR)
% Number of literals : 382 ( 88 equ; 236 neg)
% Maximal clause size : 7 ( 2 avg)
% Maximal term depth : 4 ( 1 avg)
% Number of predicates : 11 ( 9 usr; 1 prp; 0-2 aty)
% Number of functors : 13 ( 13 usr; 5 con; 0-2 aty)
% Number of variables : 186 ( 32 sgn)
% Comments :
%------------------------------------------------------------------------------
cnf(clause179,axiom,
( ~ ssList(X5)
| ~ duplicatefreeP(X5)
| ~ ssItem(X2)
| ~ ssList(X1)
| ~ ssList(X3)
| ~ ssList(X4)
| app(app(X1,cons(X2,X3)),cons(X2,X4)) != X5 ),
file('/export/starexec/sandbox/benchmark/Axioms/SWC001-0.ax',clause179) ).
cnf(clause169,axiom,
( ~ ssList(X1)
| ~ ssItem(X2)
| ~ memberP(X1,X2)
| app(skaf42(X1,X2),cons(X2,skaf43(X2,X1))) = X1 ),
file('/export/starexec/sandbox/benchmark/Axioms/SWC001-0.ax',clause169) ).
cnf(clause109,axiom,
( ~ ssList(X1)
| nil = X1
| cons(skaf83(X1),skaf82(X1)) = X1 ),
file('/export/starexec/sandbox/benchmark/Axioms/SWC001-0.ax',clause109) ).
cnf(co1_2,negated_conjecture,
ssList(sk2),
file('/export/starexec/sandbox/benchmark/theBenchmark.p',co1_2) ).
cnf(co1_5,negated_conjecture,
sk2 = sk4,
file('/export/starexec/sandbox/benchmark/theBenchmark.p',co1_5) ).
cnf(clause138,axiom,
( ~ ssItem(X1)
| ~ ssItem(X2)
| ~ ssList(X3)
| X1 != X2
| memberP(cons(X2,X3),X1) ),
file('/export/starexec/sandbox/benchmark/Axioms/SWC001-0.ax',clause138) ).
cnf(clause52,axiom,
ssList(skaf43(X1,X2)),
file('/export/starexec/sandbox/benchmark/Axioms/SWC001-0.ax',clause52) ).
cnf(clause53,axiom,
ssList(skaf42(X1,X2)),
file('/export/starexec/sandbox/benchmark/Axioms/SWC001-0.ax',clause53) ).
cnf(clause12,axiom,
ssItem(skaf83(X1)),
file('/export/starexec/sandbox/benchmark/Axioms/SWC001-0.ax',clause12) ).
cnf(clause13,axiom,
ssList(skaf82(X1)),
file('/export/starexec/sandbox/benchmark/Axioms/SWC001-0.ax',clause13) ).
cnf(clause72,axiom,
( ~ ssList(X1)
| ssItem(X2)
| duplicatefreeP(X1) ),
file('/export/starexec/sandbox/benchmark/Axioms/SWC001-0.ax',clause72) ).
cnf(clause50,axiom,
ssList(skaf46(X1,X2)),
file('/export/starexec/sandbox/benchmark/Axioms/SWC001-0.ax',clause50) ).
cnf(clause73,axiom,
( ~ ssList(X1)
| app(X1,nil) = X1 ),
file('/export/starexec/sandbox/benchmark/Axioms/SWC001-0.ax',clause73) ).
cnf(clause131,axiom,
( ~ ssList(X1)
| ~ ssList(X2)
| ~ rearsegP(X1,X2)
| app(skaf46(X1,X2),X2) = X1 ),
file('/export/starexec/sandbox/benchmark/Axioms/SWC001-0.ax',clause131) ).
cnf(clause58,axiom,
( ~ ssList(X1)
| rearsegP(X1,nil) ),
file('/export/starexec/sandbox/benchmark/Axioms/SWC001-0.ax',clause58) ).
cnf(clause8,axiom,
ssList(nil),
file('/export/starexec/sandbox/benchmark/Axioms/SWC001-0.ax',clause8) ).
cnf(clause85,axiom,
( ~ ssList(X2)
| ~ ssList(X1)
| ssList(app(X2,X1)) ),
file('/export/starexec/sandbox/benchmark/Axioms/SWC001-0.ax',clause85) ).
cnf(clause178,axiom,
( ~ ssItem(X3)
| ~ ssItem(X4)
| ~ ssList(X1)
| ~ ssList(X2)
| X3 != X4
| ~ frontsegP(X1,X2)
| frontsegP(cons(X3,X1),cons(X4,X2)) ),
file('/export/starexec/sandbox/benchmark/Axioms/SWC001-0.ax',clause178) ).
cnf(clause102,axiom,
( ~ ssItem(X2)
| ~ ssItem(X1)
| X2 = X1
| neq(X2,X1) ),
file('/export/starexec/sandbox/benchmark/Axioms/SWC001-0.ax',clause102) ).
cnf(co1_10,negated_conjecture,
( ~ equalelemsP(X1)
| ~ segmentP(X1,sk3)
| ~ frontsegP(sk4,X1)
| ~ neq(sk3,X1)
| ~ ssList(X1) ),
file('/export/starexec/sandbox/benchmark/theBenchmark.p',co1_10) ).
cnf(clause60,axiom,
( ~ ssList(X1)
| frontsegP(X1,nil) ),
file('/export/starexec/sandbox/benchmark/Axioms/SWC001-0.ax',clause60) ).
cnf(clause100,axiom,
( ~ ssList(X2)
| ~ ssList(X1)
| X2 = X1
| neq(X2,X1) ),
file('/export/starexec/sandbox/benchmark/Axioms/SWC001-0.ax',clause100) ).
cnf(co1_1,negated_conjecture,
ssList(sk1),
file('/export/starexec/sandbox/benchmark/theBenchmark.p',co1_1) ).
cnf(co1_6,negated_conjecture,
sk1 = sk3,
file('/export/starexec/sandbox/benchmark/theBenchmark.p',co1_6) ).
cnf(co1_11,negated_conjecture,
( ~ segmentP(sk2,sk1)
| ~ neq(sk1,nil) ),
file('/export/starexec/sandbox/benchmark/theBenchmark.p',co1_11) ).
cnf(clause173,axiom,
( ~ ssList(X4)
| ~ ssList(X2)
| ~ ssList(X1)
| ~ ssList(X3)
| app(app(X1,X2),X3) != X4
| segmentP(X4,X2) ),
file('/export/starexec/sandbox/benchmark/Axioms/SWC001-0.ax',clause173) ).
cnf(clause74,axiom,
( ~ ssList(X1)
| app(nil,X1) = X1 ),
file('/export/starexec/sandbox/benchmark/Axioms/SWC001-0.ax',clause74) ).
cnf(clause86,axiom,
( ~ ssList(X2)
| ~ ssItem(X1)
| ssList(cons(X1,X2)) ),
file('/export/starexec/sandbox/benchmark/Axioms/SWC001-0.ax',clause86) ).
cnf(clause132,axiom,
( ~ ssList(X1)
| ~ ssList(X2)
| ~ frontsegP(X1,X2)
| app(X2,skaf45(X1,X2)) = X1 ),
file('/export/starexec/sandbox/benchmark/Axioms/SWC001-0.ax',clause132) ).
cnf(clause64,axiom,
( ~ ssItem(X1)
| equalelemsP(cons(X1,nil)) ),
file('/export/starexec/sandbox/benchmark/Axioms/SWC001-0.ax',clause64) ).
cnf(clause51,axiom,
ssList(skaf45(X1,X2)),
file('/export/starexec/sandbox/benchmark/Axioms/SWC001-0.ax',clause51) ).
cnf(co1_8,negated_conjecture,
frontsegP(sk4,sk3),
file('/export/starexec/sandbox/benchmark/theBenchmark.p',co1_8) ).
cnf(clause56,axiom,
( ~ ssList(X1)
| segmentP(X1,nil) ),
file('/export/starexec/sandbox/benchmark/Axioms/SWC001-0.ax',clause56) ).
cnf(clause98,axiom,
( ~ ssList(X2)
| ~ ssItem(X1)
| cons(X1,X2) != nil ),
file('/export/starexec/sandbox/benchmark/Axioms/SWC001-0.ax',clause98) ).
cnf(clause115,axiom,
( ~ ssList(X1)
| ~ ssList(X2)
| ~ neq(X1,X2)
| X1 != X2 ),
file('/export/starexec/sandbox/benchmark/Axioms/SWC001-0.ax',clause115) ).
cnf(co1_7,negated_conjecture,
neq(sk2,nil),
file('/export/starexec/sandbox/benchmark/theBenchmark.p',co1_7) ).
cnf(c_0_36,plain,
( ~ ssList(X5)
| ~ duplicatefreeP(X5)
| ~ ssItem(X2)
| ~ ssList(X1)
| ~ ssList(X3)
| ~ ssList(X4)
| app(app(X1,cons(X2,X3)),cons(X2,X4)) != X5 ),
inference(fof_simplification,[status(thm)],[clause179]) ).
cnf(c_0_37,plain,
( ~ ssList(X1)
| ~ ssItem(X2)
| ~ memberP(X1,X2)
| app(skaf42(X1,X2),cons(X2,skaf43(X2,X1))) = X1 ),
inference(fof_simplification,[status(thm)],[clause169]) ).
cnf(c_0_38,plain,
( ~ ssList(X1)
| nil = X1
| cons(skaf83(X1),skaf82(X1)) = X1 ),
inference(fof_simplification,[status(thm)],[clause109]) ).
cnf(c_0_39,negated_conjecture,
ssList(sk2),
co1_2 ).
cnf(c_0_40,negated_conjecture,
sk2 = sk4,
co1_5 ).
cnf(c_0_41,plain,
( ~ ssItem(X1)
| ~ ssItem(X2)
| ~ ssList(X3)
| X1 != X2
| memberP(cons(X2,X3),X1) ),
inference(fof_simplification,[status(thm)],[clause138]) ).
cnf(c_0_42,plain,
( ~ ssList(X5)
| ~ duplicatefreeP(X5)
| ~ ssItem(X2)
| ~ ssList(X1)
| ~ ssList(X3)
| ~ ssList(X4)
| app(app(X1,cons(X2,X3)),cons(X2,X4)) != X5 ),
c_0_36 ).
cnf(c_0_43,plain,
( ~ ssList(X1)
| ~ ssItem(X2)
| ~ memberP(X1,X2)
| app(skaf42(X1,X2),cons(X2,skaf43(X2,X1))) = X1 ),
c_0_37 ).
cnf(c_0_44,axiom,
ssList(skaf43(X1,X2)),
clause52 ).
cnf(c_0_45,axiom,
ssList(skaf42(X1,X2)),
clause53 ).
cnf(c_0_46,plain,
( ~ ssList(X1)
| nil = X1
| cons(skaf83(X1),skaf82(X1)) = X1 ),
c_0_38 ).
cnf(c_0_47,negated_conjecture,
ssList(sk4),
inference(rw,[status(thm)],[c_0_39,c_0_40]) ).
cnf(c_0_48,plain,
( ~ ssItem(X1)
| ~ ssItem(X2)
| ~ ssList(X3)
| X1 != X2
| memberP(cons(X2,X3),X1) ),
c_0_41 ).
cnf(c_0_49,plain,
( ~ duplicatefreeP(X4)
| ~ ssList(X1)
| ~ ssList(X3)
| ~ ssList(X4)
| ~ ssItem(X2)
| ~ memberP(X1,X2)
| app(X1,cons(X2,X3)) != X4 ),
inference(cn,[status(thm)],[inference(rw,[status(thm)],[inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_42,c_0_43]),c_0_44]),c_0_45])]) ).
cnf(c_0_50,negated_conjecture,
( sk4 = nil
| cons(skaf83(sk4),skaf82(sk4)) = sk4 ),
inference(spm,[status(thm)],[c_0_46,c_0_47]) ).
cnf(c_0_51,axiom,
ssItem(skaf83(X1)),
clause12 ).
cnf(c_0_52,axiom,
ssList(skaf82(X1)),
clause13 ).
cnf(c_0_53,plain,
( ~ ssList(X2)
| ~ ssItem(X1)
| memberP(cons(X1,X2),X1) ),
inference(er,[status(thm)],[c_0_48]) ).
cnf(c_0_54,plain,
( ~ ssList(X1)
| ssItem(X2)
| duplicatefreeP(X1) ),
inference(fof_simplification,[status(thm)],[clause72]) ).
cnf(c_0_55,negated_conjecture,
( ~ duplicatefreeP(X2)
| ~ ssList(X1)
| ~ ssList(X2)
| ~ memberP(X1,skaf83(sk4))
| app(X1,sk4) != X2
| sk4 = nil ),
inference(cn,[status(thm)],[inference(rw,[status(thm)],[inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_49,c_0_50]),c_0_51]),c_0_52])]) ).
cnf(c_0_56,negated_conjecture,
( memberP(sk4,skaf83(sk4))
| sk4 = nil ),
inference(cn,[status(thm)],[inference(rw,[status(thm)],[inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_53,c_0_50]),c_0_51]),c_0_52])]) ).
cnf(c_0_57,plain,
( ~ ssList(X1)
| ssItem(X2)
| duplicatefreeP(X1) ),
c_0_54 ).
cnf(c_0_58,axiom,
ssList(skaf46(X1,X2)),
clause50 ).
cnf(c_0_59,plain,
( ~ ssList(X1)
| app(X1,nil) = X1 ),
inference(fof_simplification,[status(thm)],[clause73]) ).
cnf(c_0_60,plain,
( ~ ssList(X1)
| ~ ssList(X2)
| ~ rearsegP(X1,X2)
| app(skaf46(X1,X2),X2) = X1 ),
inference(fof_simplification,[status(thm)],[clause131]) ).
cnf(c_0_61,plain,
( ~ ssList(X1)
| rearsegP(X1,nil) ),
inference(fof_simplification,[status(thm)],[clause58]) ).
cnf(c_0_62,negated_conjecture,
( ~ duplicatefreeP(X1)
| ~ ssList(X1)
| app(sk4,sk4) != X1
| sk4 = nil ),
inference(cn,[status(thm)],[inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_55,c_0_56]),c_0_47])]) ).
cnf(c_0_63,plain,
( duplicatefreeP(skaf46(X2,X3))
| ssItem(X1) ),
inference(spm,[status(thm)],[c_0_57,c_0_58]) ).
cnf(c_0_64,plain,
( ~ ssList(X1)
| app(X1,nil) = X1 ),
c_0_59 ).
cnf(c_0_65,plain,
( ~ ssList(X1)
| ~ ssList(X2)
| ~ rearsegP(X1,X2)
| app(skaf46(X1,X2),X2) = X1 ),
c_0_60 ).
cnf(c_0_66,axiom,
ssList(nil),
clause8 ).
cnf(c_0_67,plain,
( ~ ssList(X1)
| rearsegP(X1,nil) ),
c_0_61 ).
cnf(c_0_68,negated_conjecture,
( skaf46(X2,X3) != app(sk4,sk4)
| ssItem(X1)
| sk4 = nil ),
inference(cn,[status(thm)],[inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_62,c_0_63]),c_0_58])]) ).
cnf(c_0_69,plain,
( ~ ssList(X1)
| skaf46(X1,nil) = X1 ),
inference(csr,[status(thm)],[inference(cn,[status(thm)],[inference(rw,[status(thm)],[inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_64,c_0_65]),c_0_58]),c_0_66])]),c_0_67]) ).
cnf(c_0_70,negated_conjecture,
( ~ ssList(X2)
| X2 != app(sk4,sk4)
| ssItem(X1)
| sk4 = nil ),
inference(spm,[status(thm)],[c_0_68,c_0_69]) ).
cnf(c_0_71,plain,
( ~ ssList(X2)
| ~ ssList(X1)
| ssList(app(X2,X1)) ),
inference(fof_simplification,[status(thm)],[clause85]) ).
cnf(c_0_72,plain,
( ~ ssItem(X3)
| ~ ssItem(X4)
| ~ ssList(X1)
| ~ ssList(X2)
| X3 != X4
| ~ frontsegP(X1,X2)
| frontsegP(cons(X3,X1),cons(X4,X2)) ),
inference(fof_simplification,[status(thm)],[clause178]) ).
cnf(c_0_73,plain,
( ~ ssItem(X2)
| ~ ssItem(X1)
| X2 = X1
| neq(X2,X1) ),
inference(fof_simplification,[status(thm)],[clause102]) ).
cnf(c_0_74,negated_conjecture,
( ~ ssList(app(sk4,sk4))
| ssItem(X1)
| sk4 = nil ),
inference(er,[status(thm)],[c_0_70]) ).
cnf(c_0_75,plain,
( ~ ssList(X2)
| ~ ssList(X1)
| ssList(app(X2,X1)) ),
c_0_71 ).
cnf(c_0_76,plain,
( ~ ssItem(X3)
| ~ ssItem(X4)
| ~ ssList(X1)
| ~ ssList(X2)
| X3 != X4
| ~ frontsegP(X1,X2)
| frontsegP(cons(X3,X1),cons(X4,X2)) ),
c_0_72 ).
cnf(c_0_77,negated_conjecture,
( ~ equalelemsP(X1)
| ~ segmentP(X1,sk3)
| ~ frontsegP(sk4,X1)
| ~ neq(sk3,X1)
| ~ ssList(X1) ),
inference(fof_simplification,[status(thm)],[co1_10]) ).
cnf(c_0_78,plain,
( ~ ssItem(X2)
| ~ ssItem(X1)
| X2 = X1
| neq(X2,X1) ),
c_0_73 ).
cnf(c_0_79,negated_conjecture,
( ssItem(X1)
| sk4 = nil ),
inference(cn,[status(thm)],[inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_74,c_0_75]),c_0_47])]) ).
cnf(c_0_80,plain,
( ~ ssList(X2)
| ~ ssList(X3)
| ~ ssItem(X1)
| ~ frontsegP(X2,X3)
| frontsegP(cons(X1,X2),cons(X1,X3)) ),
inference(er,[status(thm)],[c_0_76]) ).
cnf(c_0_81,plain,
( ~ ssList(X1)
| frontsegP(X1,nil) ),
inference(fof_simplification,[status(thm)],[clause60]) ).
cnf(c_0_82,plain,
( ~ ssList(X2)
| ~ ssList(X1)
| X2 = X1
| neq(X2,X1) ),
inference(fof_simplification,[status(thm)],[clause100]) ).
cnf(c_0_83,negated_conjecture,
ssList(sk1),
co1_1 ).
cnf(c_0_84,negated_conjecture,
sk1 = sk3,
co1_6 ).
cnf(c_0_85,negated_conjecture,
( ~ equalelemsP(X1)
| ~ segmentP(X1,sk3)
| ~ frontsegP(sk4,X1)
| ~ neq(sk3,X1)
| ~ ssList(X1) ),
c_0_77 ).
cnf(c_0_86,negated_conjecture,
( neq(X2,X1)
| X1 = X2
| sk4 = nil ),
inference(csr,[status(thm)],[inference(spm,[status(thm)],[c_0_78,c_0_79]),c_0_79]) ).
cnf(c_0_87,negated_conjecture,
( ~ ssList(X1)
| ~ frontsegP(skaf82(sk4),X1)
| frontsegP(sk4,cons(skaf83(sk4),X1))
| sk4 = nil ),
inference(cn,[status(thm)],[inference(rw,[status(thm)],[inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_80,c_0_50]),c_0_51]),c_0_52])]) ).
cnf(c_0_88,plain,
( ~ ssList(X1)
| frontsegP(X1,nil) ),
c_0_81 ).
cnf(c_0_89,negated_conjecture,
( ~ segmentP(sk2,sk1)
| ~ neq(sk1,nil) ),
inference(fof_simplification,[status(thm)],[co1_11]) ).
cnf(c_0_90,plain,
( ~ ssList(X2)
| ~ ssList(X1)
| X2 = X1
| neq(X2,X1) ),
c_0_82 ).
cnf(c_0_91,negated_conjecture,
ssList(sk3),
inference(rw,[status(thm)],[c_0_83,c_0_84]) ).
cnf(c_0_92,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_93,plain,
( ~ ssList(X1)
| app(nil,X1) = X1 ),
inference(fof_simplification,[status(thm)],[clause74]) ).
cnf(c_0_94,negated_conjecture,
( ~ equalelemsP(X1)
| ~ ssList(X1)
| ~ segmentP(X1,sk3)
| ~ frontsegP(sk4,X1)
| X1 = sk3
| sk4 = nil ),
inference(spm,[status(thm)],[c_0_85,c_0_86]) ).
cnf(c_0_95,negated_conjecture,
( frontsegP(sk4,cons(skaf83(sk4),nil))
| sk4 = nil ),
inference(cn,[status(thm)],[inference(rw,[status(thm)],[inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_87,c_0_88]),c_0_66]),c_0_52])]) ).
cnf(c_0_96,plain,
( ~ ssList(X2)
| ~ ssItem(X1)
| ssList(cons(X1,X2)) ),
inference(fof_simplification,[status(thm)],[clause86]) ).
cnf(c_0_97,negated_conjecture,
( ~ segmentP(sk2,sk1)
| ~ neq(sk1,nil) ),
c_0_89 ).
cnf(c_0_98,negated_conjecture,
( ~ ssList(X1)
| neq(sk3,X1)
| X1 = sk3 ),
inference(spm,[status(thm)],[c_0_90,c_0_91]) ).
cnf(c_0_99,plain,
( ~ ssList(X4)
| ~ ssList(X2)
| ~ ssList(X1)
| ~ ssList(X3)
| app(app(X1,X2),X3) != X4
| segmentP(X4,X2) ),
c_0_92 ).
cnf(c_0_100,plain,
( ~ ssList(X1)
| app(nil,X1) = X1 ),
c_0_93 ).
cnf(c_0_101,plain,
( ~ ssList(X1)
| ~ ssList(X2)
| ~ frontsegP(X1,X2)
| app(X2,skaf45(X1,X2)) = X1 ),
inference(fof_simplification,[status(thm)],[clause132]) ).
cnf(c_0_102,negated_conjecture,
( ~ equalelemsP(cons(skaf83(sk4),nil))
| ~ ssList(cons(skaf83(sk4),nil))
| ~ segmentP(cons(skaf83(sk4),nil),sk3)
| sk4 = nil
| cons(skaf83(sk4),nil) = sk3 ),
inference(spm,[status(thm)],[c_0_94,c_0_95]) ).
cnf(c_0_103,plain,
( ~ ssList(X2)
| ~ ssItem(X1)
| ssList(cons(X1,X2)) ),
c_0_96 ).
cnf(c_0_104,plain,
( ~ ssItem(X1)
| equalelemsP(cons(X1,nil)) ),
inference(fof_simplification,[status(thm)],[clause64]) ).
cnf(c_0_105,negated_conjecture,
( ~ segmentP(sk4,sk3)
| ~ neq(sk3,nil) ),
inference(rw,[status(thm)],[inference(rw,[status(thm)],[inference(rw,[status(thm)],[c_0_97,c_0_84]),c_0_84]),c_0_40]) ).
cnf(c_0_106,negated_conjecture,
( neq(sk3,nil)
| sk3 = nil ),
inference(spm,[status(thm)],[c_0_98,c_0_66]) ).
cnf(c_0_107,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_99,c_0_100]),c_0_66])]) ).
cnf(c_0_108,plain,
( ~ ssList(X1)
| ~ ssList(X2)
| ~ frontsegP(X1,X2)
| app(X2,skaf45(X1,X2)) = X1 ),
c_0_101 ).
cnf(c_0_109,axiom,
ssList(skaf45(X1,X2)),
clause51 ).
cnf(c_0_110,negated_conjecture,
( ~ equalelemsP(cons(skaf83(sk4),nil))
| ~ segmentP(cons(skaf83(sk4),nil),sk3)
| sk4 = nil
| cons(skaf83(sk4),nil) = sk3 ),
inference(cn,[status(thm)],[inference(rw,[status(thm)],[inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_102,c_0_103]),c_0_51]),c_0_66])]) ).
cnf(c_0_111,plain,
( ~ ssItem(X1)
| equalelemsP(cons(X1,nil)) ),
c_0_104 ).
cnf(c_0_112,negated_conjecture,
( ~ segmentP(sk4,sk3)
| sk3 = nil ),
inference(spm,[status(thm)],[c_0_105,c_0_106]) ).
cnf(c_0_113,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_107,c_0_108]),c_0_109])])]) ).
cnf(c_0_114,negated_conjecture,
frontsegP(sk4,sk3),
co1_8 ).
cnf(c_0_115,negated_conjecture,
( ~ segmentP(cons(skaf83(sk4),nil),sk3)
| sk4 = nil
| cons(skaf83(sk4),nil) = sk3 ),
inference(cn,[status(thm)],[inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_110,c_0_111]),c_0_51])]) ).
cnf(c_0_116,negated_conjecture,
sk3 = nil,
inference(cn,[status(thm)],[inference(rw,[status(thm)],[inference(rw,[status(thm)],[inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_112,c_0_113]),c_0_114]),c_0_47]),c_0_91])]) ).
cnf(c_0_117,plain,
( ~ ssList(X1)
| segmentP(X1,nil) ),
inference(fof_simplification,[status(thm)],[clause56]) ).
cnf(c_0_118,negated_conjecture,
( ~ segmentP(cons(skaf83(sk4),nil),nil)
| sk4 = nil
| cons(skaf83(sk4),nil) = nil ),
inference(rw,[status(thm)],[inference(rw,[status(thm)],[c_0_115,c_0_116]),c_0_116]) ).
cnf(c_0_119,plain,
( ~ ssList(X1)
| segmentP(X1,nil) ),
c_0_117 ).
cnf(c_0_120,plain,
( ~ ssList(X2)
| ~ ssItem(X1)
| cons(X1,X2) != nil ),
inference(fof_simplification,[status(thm)],[clause98]) ).
cnf(c_0_121,negated_conjecture,
( ~ ssList(cons(skaf83(sk4),nil))
| sk4 = nil
| cons(skaf83(sk4),nil) = nil ),
inference(spm,[status(thm)],[c_0_118,c_0_119]) ).
cnf(c_0_122,plain,
( ~ ssList(X1)
| ~ ssList(X2)
| ~ neq(X1,X2)
| X1 != X2 ),
inference(fof_simplification,[status(thm)],[clause115]) ).
cnf(c_0_123,negated_conjecture,
neq(sk2,nil),
co1_7 ).
cnf(c_0_124,plain,
( ~ ssList(X2)
| ~ ssItem(X1)
| cons(X1,X2) != nil ),
c_0_120 ).
cnf(c_0_125,negated_conjecture,
( sk4 = nil
| cons(skaf83(sk4),nil) = nil ),
inference(cn,[status(thm)],[inference(rw,[status(thm)],[inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_121,c_0_103]),c_0_51]),c_0_66])]) ).
cnf(c_0_126,plain,
( ~ ssList(X1)
| ~ ssList(X2)
| ~ neq(X1,X2)
| X1 != X2 ),
c_0_122 ).
cnf(c_0_127,negated_conjecture,
neq(sk4,nil),
inference(rw,[status(thm)],[c_0_123,c_0_40]) ).
cnf(c_0_128,negated_conjecture,
sk4 = nil,
inference(cn,[status(thm)],[inference(rw,[status(thm)],[inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_124,c_0_125]),c_0_51]),c_0_66])]) ).
cnf(c_0_129,plain,
( ~ ssList(X1)
| ~ neq(X1,X1) ),
inference(er,[status(thm)],[c_0_126]) ).
cnf(c_0_130,negated_conjecture,
neq(nil,nil),
inference(rw,[status(thm)],[c_0_127,c_0_128]) ).
cnf(c_0_131,negated_conjecture,
$false,
inference(cn,[status(thm)],[inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_129,c_0_130]),c_0_66])]),
[proof] ).
%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.00/0.02 % Problem : SWC123-1 : TPTP v9.3.1. Released v2.4.0.
% 0.00/0.04 % Command : run_E /export/starexec/sandbox/benchmark/theBenchmark.p 300 THM
% 0.09/0.36 % Computer : n011.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:57:25 UTC 2026
% 0.09/0.36 % CPUTime :
% 0.09/0.36 Running run_E /export/starexec/sandbox/benchmark/theBenchmark.p 300 THM
% 0.13/0.40 Running first-order theorem proving
% 0.13/0.40 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
% 9.76/1.86 % Version: 3.5.1
% 9.76/1.86 % Preprocessing class: FSLSSMSSSSSNFFN.
% 9.76/1.86 % Scheduled 4 strats onto 8 cores with 300 seconds (2400 total)
% 9.76/1.86 % Starting G-E--_207_C18_F1_SE_CS_SP_PI_PS_S5PRR_S2S with 1500s (5) cores
% 9.76/1.86 % Starting new_bool_3 with 300s (1) cores
% 9.76/1.86 % Starting new_bool_1 with 300s (1) cores
% 9.76/1.86 % Starting sh5l with 300s (1) cores
% 9.76/1.86 % G-E--_207_C18_F1_SE_CS_SP_PI_PS_S5PRR_S2S with pid 1401331 completed with status 0
% 9.76/1.86 % Result found by G-E--_207_C18_F1_SE_CS_SP_PI_PS_S5PRR_S2S
% 9.76/1.86 % Preprocessing class: FSLSSMSSSSSNFFN.
% 9.76/1.86 % Scheduled 4 strats onto 8 cores with 300 seconds (2400 total)
% 9.76/1.86 % Starting G-E--_207_C18_F1_SE_CS_SP_PI_PS_S5PRR_S2S with 1500s (5) cores
% 9.76/1.86 % (lift_lambdas = 1, lambda_to_forall = 1,unroll_only_formulas = 1, sine = Auto)
% 9.76/1.86 % No SInE strategy applied
% 9.76/1.86 % Search class: FGHSM-FSLM21-MFFFFFNN
% 9.76/1.86 % Scheduled 10 strats onto 5 cores with 1500 seconds (1500 total)
% 9.76/1.86 % Starting SubtermCWHack with 136s (1) cores
% 9.76/1.86 % Starting G-E--_207_C18_F1_SE_CS_SP_PI_PS_S5PRR_S2S with 151s (1) cores
% 9.76/1.86 % Starting G-E--_107_C45_F1_PI_AE_Q7_CS_SP_PS_S0Y with 136s (1) cores
% 9.76/1.86 % Starting G-E--_200_B02_F1_SE_CS_SP_PI_S2k with 136s (1) cores
% 9.76/1.86 % Starting G-E--_301_C18_F1_URBAN_S5PRR_RG_S04BN with 136s (1) cores
% 9.76/1.86 % G-E--_301_C18_F1_URBAN_S5PRR_RG_S04BN with pid 1401341 completed with status 0
% 9.76/1.86 % Result found by G-E--_301_C18_F1_URBAN_S5PRR_RG_S04BN
% 9.76/1.86 % Preprocessing class: FSLSSMSSSSSNFFN.
% 9.76/1.86 % Scheduled 4 strats onto 8 cores with 300 seconds (2400 total)
% 9.76/1.86 % Starting G-E--_207_C18_F1_SE_CS_SP_PI_PS_S5PRR_S2S with 1500s (5) cores
% 9.76/1.86 % (lift_lambdas = 1, lambda_to_forall = 1,unroll_only_formulas = 1, sine = Auto)
% 9.76/1.86 % No SInE strategy applied
% 9.76/1.86 % Search class: FGHSM-FSLM21-MFFFFFNN
% 9.76/1.86 % Scheduled 10 strats onto 5 cores with 1500 seconds (1500 total)
% 9.76/1.86 % Starting SubtermCWHack with 136s (1) cores
% 9.76/1.86 % Starting G-E--_207_C18_F1_SE_CS_SP_PI_PS_S5PRR_S2S with 151s (1) cores
% 9.76/1.86 % Starting G-E--_107_C45_F1_PI_AE_Q7_CS_SP_PS_S0Y with 136s (1) cores
% 9.76/1.86 % Starting G-E--_200_B02_F1_SE_CS_SP_PI_S2k with 136s (1) cores
% 9.76/1.86 % Starting G-E--_301_C18_F1_URBAN_S5PRR_RG_S04BN with 136s (1) cores
% 9.76/1.86 % Preprocessing time : 0.005 s
% 9.76/1.86
% 9.76/1.86 % Proof found!
% 9.76/1.86 % SZS status Unsatisfiable
% 9.76/1.86 % SZS output start CNFRefutation
% See solution above
% 9.76/1.86 % Parsed axioms : 196
% 9.76/1.86 % Removed by relevancy pruning/SinE : 0
% 9.76/1.86 % Initial clauses : 196
% 9.76/1.86 % Removed in clause preprocessing : 0
% 9.76/1.86 % Initial clauses in saturation : 196
% 9.76/1.86 % Processed clauses : 2883
% 9.76/1.86 % ...of these trivial : 26
% 9.76/1.86 % ...subsumed : 1244
% 9.76/1.86 % ...remaining for further processing : 1613
% 9.76/1.86 % Other redundant clauses eliminated : 140
% 9.76/1.86 % Clauses deleted for lack of memory : 0
% 9.76/1.86 % Backward-subsumed : 119
% 9.76/1.86 % Backward-rewritten : 653
% 9.76/1.86 % Generated clauses : 28005
% 9.76/1.86 % ...of the previous two non-redundant : 26794
% 9.76/1.86 % ...aggressively subsumed : 0
% 9.76/1.86 % Contextual simplify-reflections : 304
% 9.76/1.86 % Paramodulations : 27516
% 9.76/1.86 % Factorizations : 186
% 9.76/1.86 % NegExts : 0
% 9.76/1.86 % Equation resolutions : 303
% 9.76/1.86 % Disequality decompositions : 0
% 9.76/1.86 % Total rewrite steps : 17458
% 9.76/1.86 % ...of those cached : 16801
% 9.76/1.86 % Propositional unsat checks : 0
% 9.76/1.86 % Propositional check models : 0
% 9.76/1.86 % Propositional check unsatisfiable : 0
% 9.76/1.86 % Propositional clauses : 0
% 9.76/1.86 % Propositional clauses after purity: 0
% 9.76/1.86 % Propositional unsat core size : 0
% 9.76/1.86 % Propositional preprocessing time : 0.000
% 9.76/1.86 % Propositional encoding time : 0.000
% 9.76/1.86 % Propositional solver time : 0.000
% 9.76/1.86 % Success case prop preproc time : 0.000
% 9.76/1.86 % Success case prop encoding time : 0.000
% 9.76/1.86 % Success case prop solver time : 0.000
% 9.76/1.86 % Current number of processed clauses : 836
% 9.76/1.86 % Positive orientable unit clauses : 60
% 9.76/1.86 % Positive unorientable unit clauses: 0
% 9.76/1.86 % Negative unit clauses : 2
% 9.76/1.86 % Non-unit-clauses : 774
% 9.76/1.86 % Current number of unprocessed clauses: 23923
% 9.76/1.86 % ...number of literals in the above : 120677
% 9.76/1.86 % Current number of archived formulas : 0
% 9.76/1.86 % Current number of archived clauses : 772
% 9.76/1.86 % Clause-clause subsumption calls (NU) : 305419
% 9.76/1.86 % Rec. Clause-clause subsumption calls : 56078
% 9.76/1.86 % Non-unit clause-clause subsumptions : 1538
% 9.76/1.86 % Unit Clause-clause subsumption calls : 1276
% 9.76/1.86 % Rewrite failures with RHS unbound : 0
% 9.76/1.86 % BW rewrite match attempts : 5
% 9.76/1.86 % BW rewrite match successes : 5
% 9.76/1.86 % Condensation attempts : 0
% 9.76/1.86 % Condensation successes : 0
% 9.76/1.86 % Termbank termtop insertions : 510113
% 9.76/1.86 % Search garbage collected termcells : 543
% 9.76/1.86
% 9.76/1.86 % -------------------------------------------------
% 9.76/1.86 % User time : 1.349 s
% 9.76/1.86 % System time : 0.048 s
% 9.76/1.86 % Total time : 1.397 s
% 9.76/1.86 % Maximum resident set size: 4068 pages
% 9.76/1.86
% 9.76/1.86 % -------------------------------------------------
% 9.76/1.86 % User time : 6.110 s
% 9.76/1.86 % System time : 0.223 s
% 9.76/1.86 % Total time : 6.334 s
% 9.76/1.86 % Maximum resident set size: 4864 pages
% 9.76/1.86 % E exiting
%------------------------------------------------------------------------------