%------------------------------------------------------------------------------
% File : CSE_E---1.7
% Problem : SWC117-1 : TPTP v9.2.1. Released v2.4.0.
% Transfm : none
% Format : tptp:raw
% Command : /export/starexec/sandbox2/solver/bin/lemma_parallel_prover %s --lemma-prover /export/starexec/sandbox2/solver/bin/cse --final-prover /export/starexec/sandbox2/solver/bin/eprover --proof-time %d --global-time-limit %d
% Computer : n026.cluster.edu
% Model : x86_64 x86_64
% CPU : Intel(R) Xeon(R) CPU E5-2620 v4 2.10GHz
% Memory : 8042.1875MB
% OS : Linux 3.10.0-693.el7.x86_64
% CPULimit : 300s
% WCLimit : 300s
% DateTime : Tue May 5 05:18:21 PM UTC 2026
% Result : Unsatisfiable 6.76s 4.63s
% Output : CNFRefutation 6.76s
% Verified :
% SZS Type : Refutation
% Derivation depth : 16
% Number of leaves : 36
% Syntax : Number of clauses : 113 ( 33 unt; 15 nHn; 93 RR)
% Number of literals : 308 ( 59 equ; 204 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 : 15 ( 15 usr; 5 con; 0-2 aty)
% Number of variables : 156 ( 27 sgn)
% Comments :
%------------------------------------------------------------------------------
cnf(clause179,axiom,
( app(app(X1,cons(X2,X3)),cons(X2,X4)) != X5
| ~ ssList(X4)
| ~ ssList(X3)
| ~ ssList(X1)
| ~ ssItem(X2)
| ~ duplicatefreeP(X5)
| ~ ssList(X5) ),
file('/export/starexec/sandbox2/benchmark/Axioms/SWC001-0.ax',clause179) ).
cnf(clause169,axiom,
( app(skaf42(X1,X2),cons(X2,skaf43(X2,X1))) = X1
| ~ memberP(X1,X2)
| ~ ssItem(X2)
| ~ ssList(X1) ),
file('/export/starexec/sandbox2/benchmark/Axioms/SWC001-0.ax',clause169) ).
cnf(clause52,axiom,
ssList(skaf43(X1,X2)),
file('/export/starexec/sandbox2/benchmark/Axioms/SWC001-0.ax',clause52) ).
cnf(clause53,axiom,
ssList(skaf42(X1,X2)),
file('/export/starexec/sandbox2/benchmark/Axioms/SWC001-0.ax',clause53) ).
cnf(clause138,axiom,
( memberP(cons(X2,X3),X1)
| X1 != X2
| ~ ssList(X3)
| ~ ssItem(X2)
| ~ ssItem(X1) ),
file('/export/starexec/sandbox2/benchmark/Axioms/SWC001-0.ax',clause138) ).
cnf(clause72,axiom,
( duplicatefreeP(X1)
| ssItem(X2)
| ~ ssList(X1) ),
file('/export/starexec/sandbox2/benchmark/Axioms/SWC001-0.ax',clause72) ).
cnf(clause85,axiom,
( ssList(app(X2,X1))
| ~ ssList(X1)
| ~ ssList(X2) ),
file('/export/starexec/sandbox2/benchmark/Axioms/SWC001-0.ax',clause85) ).
cnf(co1_2,negated_conjecture,
ssList(sk2),
file('/export/starexec/sandbox2/benchmark/theBenchmark.p',co1_2) ).
cnf(co1_5,negated_conjecture,
sk2 = sk4,
file('/export/starexec/sandbox2/benchmark/theBenchmark.p',co1_5) ).
cnf(co1_11,negated_conjecture,
( ~ neq(sk1,nil)
| ~ segmentP(sk2,sk1) ),
file('/export/starexec/sandbox2/benchmark/theBenchmark.p',co1_11) ).
cnf(co1_6,negated_conjecture,
sk1 = sk3,
file('/export/starexec/sandbox2/benchmark/theBenchmark.p',co1_6) ).
cnf(co1_7,negated_conjecture,
segmentP(sk4,sk3),
file('/export/starexec/sandbox2/benchmark/theBenchmark.p',co1_7) ).
cnf(co1_1,negated_conjecture,
ssList(sk1),
file('/export/starexec/sandbox2/benchmark/theBenchmark.p',co1_1) ).
cnf(clause109,axiom,
( cons(skaf83(X1),skaf82(X1)) = X1
| nil = X1
| ~ ssList(X1) ),
file('/export/starexec/sandbox2/benchmark/Axioms/SWC001-0.ax',clause109) ).
cnf(clause12,axiom,
ssItem(skaf83(X1)),
file('/export/starexec/sandbox2/benchmark/Axioms/SWC001-0.ax',clause12) ).
cnf(clause13,axiom,
ssList(skaf82(X1)),
file('/export/starexec/sandbox2/benchmark/Axioms/SWC001-0.ax',clause13) ).
cnf(co1_10,negated_conjecture,
( nil != sk2
| nil != sk1 ),
file('/export/starexec/sandbox2/benchmark/theBenchmark.p',co1_10) ).
cnf(clause100,axiom,
( neq(X2,X1)
| X2 = X1
| ~ ssList(X1)
| ~ ssList(X2) ),
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(clause97,axiom,
( hd(cons(X1,X2)) = X1
| ~ ssItem(X1)
| ~ ssList(X2) ),
file('/export/starexec/sandbox2/benchmark/Axioms/SWC001-0.ax',clause97) ).
cnf(clause101,axiom,
( cons(skaf44(X1),nil) = X1
| ~ singletonP(X1)
| ~ ssList(X1) ),
file('/export/starexec/sandbox2/benchmark/Axioms/SWC001-0.ax',clause101) ).
cnf(clause47,axiom,
ssItem(skaf44(X1)),
file('/export/starexec/sandbox2/benchmark/Axioms/SWC001-0.ax',clause47) ).
cnf(clause116,axiom,
( singletonP(X2)
| cons(X1,nil) != X2
| ~ ssItem(X1)
| ~ ssList(X2) ),
file('/export/starexec/sandbox2/benchmark/Axioms/SWC001-0.ax',clause116) ).
cnf(co1_9,negated_conjecture,
( ~ ssList(X1)
| ~ neq(sk3,X1)
| ~ segmentP(sk4,X1)
| ~ segmentP(X1,sk3)
| ~ equalelemsP(X1) ),
file('/export/starexec/sandbox2/benchmark/theBenchmark.p',co1_9) ).
cnf(clause56,axiom,
( segmentP(X1,nil)
| ~ ssList(X1) ),
file('/export/starexec/sandbox2/benchmark/Axioms/SWC001-0.ax',clause56) ).
cnf(clause98,axiom,
( cons(X1,X2) != nil
| ~ ssItem(X1)
| ~ ssList(X2) ),
file('/export/starexec/sandbox2/benchmark/Axioms/SWC001-0.ax',clause98) ).
cnf(clause64,axiom,
( equalelemsP(cons(X1,nil))
| ~ ssItem(X1) ),
file('/export/starexec/sandbox2/benchmark/Axioms/SWC001-0.ax',clause64) ).
cnf(clause86,axiom,
( ssList(cons(X1,X2))
| ~ ssItem(X1)
| ~ ssList(X2) ),
file('/export/starexec/sandbox2/benchmark/Axioms/SWC001-0.ax',clause86) ).
cnf(clause173,axiom,
( segmentP(X4,X2)
| app(app(X1,X2),X3) != X4
| ~ ssList(X3)
| ~ ssList(X1)
| ~ ssList(X2)
| ~ ssList(X4) ),
file('/export/starexec/sandbox2/benchmark/Axioms/SWC001-0.ax',clause173) ).
cnf(clause74,axiom,
( app(nil,X1) = X1
| ~ ssList(X1) ),
file('/export/starexec/sandbox2/benchmark/Axioms/SWC001-0.ax',clause74) ).
cnf(clause178,axiom,
( frontsegP(cons(X3,X1),cons(X4,X2))
| ~ frontsegP(X1,X2)
| X3 != X4
| ~ ssList(X2)
| ~ ssList(X1)
| ~ ssItem(X4)
| ~ ssItem(X3) ),
file('/export/starexec/sandbox2/benchmark/Axioms/SWC001-0.ax',clause178) ).
cnf(clause132,axiom,
( app(X2,skaf45(X1,X2)) = X1
| ~ frontsegP(X1,X2)
| ~ ssList(X2)
| ~ ssList(X1) ),
file('/export/starexec/sandbox2/benchmark/Axioms/SWC001-0.ax',clause132) ).
cnf(clause51,axiom,
ssList(skaf45(X1,X2)),
file('/export/starexec/sandbox2/benchmark/Axioms/SWC001-0.ax',clause51) ).
cnf(clause104,axiom,
( cons(hd(X1),tl(X1)) = X1
| nil = X1
| ~ ssList(X1) ),
file('/export/starexec/sandbox2/benchmark/Axioms/SWC001-0.ax',clause104) ).
cnf(clause75,axiom,
( ssList(tl(X1))
| nil = X1
| ~ ssList(X1) ),
file('/export/starexec/sandbox2/benchmark/Axioms/SWC001-0.ax',clause75) ).
cnf(clause60,axiom,
( frontsegP(X1,nil)
| ~ ssList(X1) ),
file('/export/starexec/sandbox2/benchmark/Axioms/SWC001-0.ax',clause60) ).
cnf(c_0_36,axiom,
( app(app(X1,cons(X2,X3)),cons(X2,X4)) != X5
| ~ ssList(X4)
| ~ ssList(X3)
| ~ ssList(X1)
| ~ ssItem(X2)
| ~ duplicatefreeP(X5)
| ~ ssList(X5) ),
clause179 ).
cnf(c_0_37,plain,
( ~ ssItem(X1)
| ~ ssList(app(app(X2,cons(X1,X3)),cons(X1,X4)))
| ~ ssList(X4)
| ~ ssList(X3)
| ~ ssList(X2)
| ~ duplicatefreeP(app(app(X2,cons(X1,X3)),cons(X1,X4))) ),
inference(er,[status(thm)],[c_0_36]) ).
cnf(c_0_38,axiom,
( app(skaf42(X1,X2),cons(X2,skaf43(X2,X1))) = X1
| ~ memberP(X1,X2)
| ~ ssItem(X2)
| ~ ssList(X1) ),
clause169 ).
cnf(c_0_39,axiom,
ssList(skaf43(X1,X2)),
clause52 ).
cnf(c_0_40,axiom,
ssList(skaf42(X1,X2)),
clause53 ).
cnf(c_0_41,axiom,
( memberP(cons(X2,X3),X1)
| X1 != X2
| ~ ssList(X3)
| ~ ssItem(X2)
| ~ ssItem(X1) ),
clause138 ).
cnf(c_0_42,axiom,
( duplicatefreeP(X1)
| ssItem(X2)
| ~ ssList(X1) ),
clause72 ).
cnf(c_0_43,axiom,
( ssList(app(X2,X1))
| ~ ssList(X1)
| ~ ssList(X2) ),
clause85 ).
cnf(c_0_44,negated_conjecture,
ssList(sk2),
co1_2 ).
cnf(c_0_45,negated_conjecture,
sk2 = sk4,
co1_5 ).
cnf(c_0_46,negated_conjecture,
( ~ neq(sk1,nil)
| ~ segmentP(sk2,sk1) ),
co1_11 ).
cnf(c_0_47,negated_conjecture,
sk1 = sk3,
co1_6 ).
cnf(c_0_48,negated_conjecture,
segmentP(sk4,sk3),
co1_7 ).
cnf(c_0_49,negated_conjecture,
ssList(sk1),
co1_1 ).
cnf(c_0_50,plain,
( ~ memberP(X1,X2)
| ~ ssItem(X2)
| ~ ssList(app(X1,cons(X2,X3)))
| ~ ssList(X3)
| ~ ssList(X1)
| ~ duplicatefreeP(app(X1,cons(X2,X3))) ),
inference(cn,[status(thm)],[inference(rw,[status(thm)],[inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_37,c_0_38]),c_0_39]),c_0_40])]) ).
cnf(c_0_51,axiom,
( cons(skaf83(X1),skaf82(X1)) = X1
| nil = X1
| ~ ssList(X1) ),
clause109 ).
cnf(c_0_52,axiom,
ssItem(skaf83(X1)),
clause12 ).
cnf(c_0_53,axiom,
ssList(skaf82(X1)),
clause13 ).
cnf(c_0_54,plain,
( memberP(cons(X1,X2),X1)
| ~ ssItem(X1)
| ~ ssList(X2) ),
inference(er,[status(thm)],[c_0_41]) ).
cnf(c_0_55,plain,
( ssItem(X1)
| duplicatefreeP(app(X2,X3))
| ~ ssList(X2)
| ~ ssList(X3) ),
inference(spm,[status(thm)],[c_0_42,c_0_43]) ).
cnf(c_0_56,negated_conjecture,
ssList(sk4),
inference(rw,[status(thm)],[c_0_44,c_0_45]) ).
cnf(c_0_57,negated_conjecture,
( nil != sk2
| nil != sk1 ),
co1_10 ).
cnf(c_0_58,negated_conjecture,
~ neq(sk3,nil),
inference(cn,[status(thm)],[inference(rw,[status(thm)],[inference(rw,[status(thm)],[inference(rw,[status(thm)],[inference(rw,[status(thm)],[c_0_46,c_0_45]),c_0_47]),c_0_48]),c_0_47])]) ).
cnf(c_0_59,axiom,
( neq(X2,X1)
| X2 = X1
| ~ ssList(X1)
| ~ ssList(X2) ),
clause100 ).
cnf(c_0_60,negated_conjecture,
ssList(sk3),
inference(rw,[status(thm)],[c_0_49,c_0_47]) ).
cnf(c_0_61,axiom,
ssList(nil),
clause8 ).
cnf(c_0_62,plain,
( nil = X1
| ~ memberP(X2,skaf83(X1))
| ~ ssList(X2)
| ~ ssList(X1)
| ~ duplicatefreeP(app(X2,X1)) ),
inference(csr,[status(thm)],[inference(cn,[status(thm)],[inference(rw,[status(thm)],[inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_50,c_0_51]),c_0_52]),c_0_53])]),c_0_43]) ).
cnf(c_0_63,plain,
( nil = X1
| memberP(X1,skaf83(X1))
| ~ ssList(X1) ),
inference(cn,[status(thm)],[inference(rw,[status(thm)],[inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_54,c_0_51]),c_0_52]),c_0_53])]) ).
cnf(c_0_64,negated_conjecture,
( ssItem(X1)
| duplicatefreeP(app(sk4,X2))
| ~ ssList(X2) ),
inference(spm,[status(thm)],[c_0_55,c_0_56]) ).
cnf(c_0_65,negated_conjecture,
( sk3 != nil
| sk4 != nil ),
inference(rw,[status(thm)],[inference(rw,[status(thm)],[c_0_57,c_0_47]),c_0_45]) ).
cnf(c_0_66,negated_conjecture,
sk3 = nil,
inference(cn,[status(thm)],[inference(rw,[status(thm)],[inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_58,c_0_59]),c_0_60]),c_0_61])]) ).
cnf(c_0_67,axiom,
( hd(cons(X1,X2)) = X1
| ~ ssItem(X1)
| ~ ssList(X2) ),
clause97 ).
cnf(c_0_68,axiom,
( cons(skaf44(X1),nil) = X1
| ~ singletonP(X1)
| ~ ssList(X1) ),
clause101 ).
cnf(c_0_69,axiom,
ssItem(skaf44(X1)),
clause47 ).
cnf(c_0_70,axiom,
( singletonP(X2)
| cons(X1,nil) != X2
| ~ ssItem(X1)
| ~ ssList(X2) ),
clause116 ).
cnf(c_0_71,plain,
( nil = X1
| ~ ssList(X1)
| ~ duplicatefreeP(app(X1,X1)) ),
inference(spm,[status(thm)],[c_0_62,c_0_63]) ).
cnf(c_0_72,negated_conjecture,
( ssItem(X1)
| duplicatefreeP(app(sk4,sk4)) ),
inference(spm,[status(thm)],[c_0_64,c_0_56]) ).
cnf(c_0_73,negated_conjecture,
sk4 != nil,
inference(cn,[status(thm)],[inference(rw,[status(thm)],[c_0_65,c_0_66])]) ).
cnf(c_0_74,negated_conjecture,
( ~ ssList(X1)
| ~ neq(sk3,X1)
| ~ segmentP(sk4,X1)
| ~ segmentP(X1,sk3)
| ~ equalelemsP(X1) ),
co1_9 ).
cnf(c_0_75,axiom,
( segmentP(X1,nil)
| ~ ssList(X1) ),
clause56 ).
cnf(c_0_76,plain,
( skaf44(X1) = hd(X1)
| ~ singletonP(X1)
| ~ ssList(X1) ),
inference(cn,[status(thm)],[inference(rw,[status(thm)],[inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_67,c_0_68]),c_0_69]),c_0_61])]) ).
cnf(c_0_77,plain,
( singletonP(cons(X1,nil))
| ~ ssItem(X1)
| ~ ssList(cons(X1,nil)) ),
inference(er,[status(thm)],[c_0_70]) ).
cnf(c_0_78,negated_conjecture,
ssItem(X1),
inference(sr,[status(thm)],[inference(cn,[status(thm)],[inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_71,c_0_72]),c_0_56])]),c_0_73]) ).
cnf(c_0_79,negated_conjecture,
( ~ neq(nil,X1)
| ~ segmentP(sk4,X1)
| ~ ssList(X1)
| ~ equalelemsP(X1) ),
inference(csr,[status(thm)],[inference(rw,[status(thm)],[inference(rw,[status(thm)],[c_0_74,c_0_66]),c_0_66]),c_0_75]) ).
cnf(c_0_80,axiom,
( cons(X1,X2) != nil
| ~ ssItem(X1)
| ~ ssList(X2) ),
clause98 ).
cnf(c_0_81,plain,
( cons(hd(X1),nil) = X1
| ~ singletonP(X1)
| ~ ssList(X1) ),
inference(spm,[status(thm)],[c_0_68,c_0_76]) ).
cnf(c_0_82,plain,
( singletonP(cons(X1,nil))
| ~ ssList(cons(X1,nil)) ),
inference(cn,[status(thm)],[inference(rw,[status(thm)],[c_0_77,c_0_78])]) ).
cnf(c_0_83,negated_conjecture,
( X1 = nil
| ~ segmentP(sk4,X1)
| ~ ssList(X1)
| ~ equalelemsP(X1) ),
inference(cn,[status(thm)],[inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_79,c_0_59]),c_0_61])]) ).
cnf(c_0_84,axiom,
( equalelemsP(cons(X1,nil))
| ~ ssItem(X1) ),
clause64 ).
cnf(c_0_85,plain,
( cons(X1,X2) != nil
| ~ ssList(X2) ),
inference(cn,[status(thm)],[inference(rw,[status(thm)],[c_0_80,c_0_78])]) ).
cnf(c_0_86,plain,
( cons(hd(cons(X1,nil)),nil) = cons(X1,nil)
| ~ ssList(cons(X1,nil)) ),
inference(spm,[status(thm)],[c_0_81,c_0_82]) ).
cnf(c_0_87,axiom,
( ssList(cons(X1,X2))
| ~ ssItem(X1)
| ~ ssList(X2) ),
clause86 ).
cnf(c_0_88,axiom,
( segmentP(X4,X2)
| app(app(X1,X2),X3) != X4
| ~ ssList(X3)
| ~ ssList(X1)
| ~ ssList(X2)
| ~ ssList(X4) ),
clause173 ).
cnf(c_0_89,negated_conjecture,
( cons(X1,nil) = nil
| ~ segmentP(sk4,cons(X1,nil))
| ~ ssItem(X1)
| ~ ssList(cons(X1,nil)) ),
inference(spm,[status(thm)],[c_0_83,c_0_84]) ).
cnf(c_0_90,plain,
( cons(X1,nil) != nil
| ~ ssList(cons(X1,nil)) ),
inference(cn,[status(thm)],[inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_85,c_0_86]),c_0_61])]) ).
cnf(c_0_91,plain,
( ssList(cons(X1,X2))
| ~ ssList(X2) ),
inference(cn,[status(thm)],[inference(rw,[status(thm)],[c_0_87,c_0_78])]) ).
cnf(c_0_92,plain,
( segmentP(app(app(X1,X2),X3),X2)
| ~ ssList(app(app(X1,X2),X3))
| ~ ssList(X3)
| ~ ssList(X2)
| ~ ssList(X1) ),
inference(er,[status(thm)],[c_0_88]) ).
cnf(c_0_93,axiom,
( app(nil,X1) = X1
| ~ ssList(X1) ),
clause74 ).
cnf(c_0_94,axiom,
( frontsegP(cons(X3,X1),cons(X4,X2))
| ~ frontsegP(X1,X2)
| X3 != X4
| ~ ssList(X2)
| ~ ssList(X1)
| ~ ssItem(X4)
| ~ ssItem(X3) ),
clause178 ).
cnf(c_0_95,negated_conjecture,
( cons(X1,nil) = nil
| ~ segmentP(sk4,cons(X1,nil))
| ~ ssList(cons(X1,nil)) ),
inference(cn,[status(thm)],[inference(rw,[status(thm)],[c_0_89,c_0_78])]) ).
cnf(c_0_96,plain,
cons(X1,nil) != nil,
inference(cn,[status(thm)],[inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_90,c_0_91]),c_0_61])]) ).
cnf(c_0_97,plain,
( segmentP(app(X1,X2),X1)
| ~ ssList(X2)
| ~ ssList(X1) ),
inference(csr,[status(thm)],[inference(cn,[status(thm)],[inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_92,c_0_93]),c_0_61])]),c_0_43]) ).
cnf(c_0_98,axiom,
( app(X2,skaf45(X1,X2)) = X1
| ~ frontsegP(X1,X2)
| ~ ssList(X2)
| ~ ssList(X1) ),
clause132 ).
cnf(c_0_99,axiom,
ssList(skaf45(X1,X2)),
clause51 ).
cnf(c_0_100,plain,
( frontsegP(cons(X1,X2),cons(X1,X3))
| ~ frontsegP(X2,X3)
| ~ ssItem(X1)
| ~ ssList(X3)
| ~ ssList(X2) ),
inference(er,[status(thm)],[c_0_94]) ).
cnf(c_0_101,negated_conjecture,
( ~ segmentP(sk4,cons(X1,nil))
| ~ ssList(cons(X1,nil)) ),
inference(sr,[status(thm)],[inference(spm,[status(thm)],[c_0_95,c_0_86]),c_0_96]) ).
cnf(c_0_102,plain,
( segmentP(X1,X2)
| ~ frontsegP(X1,X2)
| ~ ssList(X2)
| ~ ssList(X1) ),
inference(cn,[status(thm)],[inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_97,c_0_98]),c_0_99])]) ).
cnf(c_0_103,plain,
( frontsegP(cons(X1,X2),cons(X1,X3))
| ~ frontsegP(X2,X3)
| ~ ssList(X3)
| ~ ssList(X2) ),
inference(cn,[status(thm)],[inference(rw,[status(thm)],[c_0_100,c_0_78])]) ).
cnf(c_0_104,axiom,
( cons(hd(X1),tl(X1)) = X1
| nil = X1
| ~ ssList(X1) ),
clause104 ).
cnf(c_0_105,axiom,
( ssList(tl(X1))
| nil = X1
| ~ ssList(X1) ),
clause75 ).
cnf(c_0_106,negated_conjecture,
( ~ frontsegP(sk4,cons(X1,nil))
| ~ ssList(cons(X1,nil)) ),
inference(cn,[status(thm)],[inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_101,c_0_102]),c_0_56])]) ).
cnf(c_0_107,plain,
( nil = X1
| frontsegP(X1,cons(hd(X1),X2))
| ~ frontsegP(tl(X1),X2)
| ~ ssList(X2)
| ~ ssList(X1) ),
inference(csr,[status(thm)],[inference(spm,[status(thm)],[c_0_103,c_0_104]),c_0_105]) ).
cnf(c_0_108,negated_conjecture,
( ~ frontsegP(tl(sk4),nil)
| ~ ssList(cons(hd(sk4),nil)) ),
inference(sr,[status(thm)],[inference(cn,[status(thm)],[inference(rw,[status(thm)],[inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_106,c_0_107]),c_0_61]),c_0_56])]),c_0_73]) ).
cnf(c_0_109,axiom,
( frontsegP(X1,nil)
| ~ ssList(X1) ),
clause60 ).
cnf(c_0_110,negated_conjecture,
( ~ ssList(cons(hd(sk4),nil))
| ~ ssList(tl(sk4)) ),
inference(spm,[status(thm)],[c_0_108,c_0_109]) ).
cnf(c_0_111,negated_conjecture,
~ ssList(tl(sk4)),
inference(cn,[status(thm)],[inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_110,c_0_91]),c_0_61])]) ).
cnf(c_0_112,negated_conjecture,
$false,
inference(sr,[status(thm)],[inference(cn,[status(thm)],[inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_111,c_0_105]),c_0_56])]),c_0_73]),
[proof] ).
%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.00/0.12 % Problem : SWC117-1 : TPTP v9.2.1. Released v2.4.0.
% 0.00/0.12 % Command : /export/starexec/sandbox2/solver/bin/lemma_parallel_prover %s --lemma-prover /export/starexec/sandbox2/solver/bin/cse --final-prover /export/starexec/sandbox2/solver/bin/eprover --proof-time %d --global-time-limit %d
% 0.14/0.33 % Computer : n026.cluster.edu
% 0.14/0.33 % Model : x86_64 x86_64
% 0.14/0.33 % CPU : Intel(R) Xeon(R) CPU E5-2620 v4 @ 2.10GHz
% 0.14/0.33 % Memory : 8042.1875MB
% 0.14/0.33 % OS : Linux 3.10.0-693.el7.x86_64
% 0.14/0.33 % CPULimit : 300
% 0.14/0.33 % WCLimit : 300
% 0.14/0.33 % DateTime : Tue May 5 04:28:08 EDT 2026
% 0.14/0.33 % CPUTime :
% 0.14/0.34 % start to proof: theBenchmark
% 6.76/4.63 % Version : CSE_E---1.7
% 6.76/4.63 % Problem : theBenchmark.p
% 6.76/4.63 % SZS status Unsatisfiable for theBenchmark.p
% 6.76/4.63 % SZS output start CNFRefutation
% See solution above
% 6.76/4.65 % Total time : 3.374s
%------------------------------------------------------------------------------