↑ Up

CSE_E---1.7.UNS-CRf.s

View TPTP
Problem
Process solution in
SystemOnTSTP
Download .tgz
%------------------------------------------------------------------------------
% File     : CSE_E---1.7
% Problem  : SWC404-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 : n003.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:19:32 PM UTC 2026

% Result   : Unsatisfiable 2.09s 1.94s
% Output   : CNFRefutation 2.09s
% Verified : 
% SZS Type : Refutation
%            Derivation depth      :   22
%            Number of leaves      :   31
% Syntax   : Number of clauses     :  111 (  40 unt;   8 nHn;  95 RR)
%            Number of literals    :  276 (  90 equ; 168 neg)
%            Maximal clause size   :    7 (   2 avg)
%            Maximal term depth    :    4 (   1 avg)
%            Number of predicates  :    7 (   5 usr;   1 prp; 0-2 aty)
%            Number of functors    :   15 (  15 usr;   8 con; 0-2 aty)
%            Number of variables   :  119 (  22 sgn)

% Comments : 
%------------------------------------------------------------------------------
cnf(clause119,axiom,
    ( nil = X2
    | app(X1,X2) != nil
    | ~ ssList(X2)
    | ~ ssList(X1) ),
    file('/export/starexec/sandbox2/benchmark/Axioms/SWC001-0.ax',clause119) ).

cnf(co1_9,negated_conjecture,
    app(app(sk5,sk3),sk6) = sk4,
    file('/export/starexec/sandbox2/benchmark/theBenchmark.p',co1_9) ).

cnf(co1_8,negated_conjecture,
    ssList(sk6),
    file('/export/starexec/sandbox2/benchmark/theBenchmark.p',co1_8) ).

cnf(co1_1,negated_conjecture,
    ssList(sk1),
    file('/export/starexec/sandbox2/benchmark/theBenchmark.p',co1_1) ).

cnf(co1_6,negated_conjecture,
    sk1 = sk3,
    file('/export/starexec/sandbox2/benchmark/theBenchmark.p',co1_6) ).

cnf(clause85,axiom,
    ( ssList(app(X2,X1))
    | ~ ssList(X1)
    | ~ ssList(X2) ),
    file('/export/starexec/sandbox2/benchmark/Axioms/SWC001-0.ax',clause85) ).

cnf(co1_7,negated_conjecture,
    ssList(sk5),
    file('/export/starexec/sandbox2/benchmark/theBenchmark.p',co1_7) ).

cnf(clause73,axiom,
    ( app(X1,nil) = X1
    | ~ ssList(X1) ),
    file('/export/starexec/sandbox2/benchmark/Axioms/SWC001-0.ax',clause73) ).

cnf(clause118,axiom,
    ( nil = X1
    | app(X1,X2) != nil
    | ~ ssList(X2)
    | ~ ssList(X1) ),
    file('/export/starexec/sandbox2/benchmark/Axioms/SWC001-0.ax',clause118) ).

cnf(co1_16,negated_conjecture,
    ( nil = sk4
    | nil != sk3 ),
    file('/export/starexec/sandbox2/benchmark/theBenchmark.p',co1_16) ).

cnf(clause8,axiom,
    ssList(nil),
    file('/export/starexec/sandbox2/benchmark/Axioms/SWC001-0.ax',clause8) ).

cnf(clause149,axiom,
    ( app(app(X3,X2),X1) = app(X3,app(X2,X1))
    | ~ ssList(X1)
    | ~ ssList(X2)
    | ~ ssList(X3) ),
    file('/export/starexec/sandbox2/benchmark/Axioms/SWC001-0.ax',clause149) ).

cnf(clause74,axiom,
    ( app(nil,X1) = X1
    | ~ ssList(X1) ),
    file('/export/starexec/sandbox2/benchmark/Axioms/SWC001-0.ax',clause74) ).

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(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_15,negated_conjecture,
    ~ memberP(sk2,sk7),
    file('/export/starexec/sandbox2/benchmark/theBenchmark.p',co1_15) ).

cnf(co1_14,negated_conjecture,
    memberP(sk1,sk7),
    file('/export/starexec/sandbox2/benchmark/theBenchmark.p',co1_14) ).

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(clause140,axiom,
    ( memberP(app(X1,X3),X2)
    | ~ memberP(X1,X2)
    | ~ ssList(X3)
    | ~ ssList(X1)
    | ~ ssItem(X2) ),
    file('/export/starexec/sandbox2/benchmark/Axioms/SWC001-0.ax',clause140) ).

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(clause141,axiom,
    ( memberP(app(X3,X1),X2)
    | ~ memberP(X1,X2)
    | ~ ssList(X1)
    | ~ ssList(X3)
    | ~ ssItem(X2) ),
    file('/export/starexec/sandbox2/benchmark/Axioms/SWC001-0.ax',clause141) ).

cnf(clause144,axiom,
    ( frontsegP(X3,X1)
    | app(X1,X2) != X3
    | ~ ssList(X2)
    | ~ ssList(X1)
    | ~ ssList(X3) ),
    file('/export/starexec/sandbox2/benchmark/Axioms/SWC001-0.ax',clause144) ).

cnf(c_0_31,axiom,
    ( nil = X2
    | app(X1,X2) != nil
    | ~ ssList(X2)
    | ~ ssList(X1) ),
    clause119 ).

cnf(c_0_32,negated_conjecture,
    app(app(sk5,sk3),sk6) = sk4,
    co1_9 ).

cnf(c_0_33,negated_conjecture,
    ssList(sk6),
    co1_8 ).

cnf(c_0_34,negated_conjecture,
    ssList(sk1),
    co1_1 ).

cnf(c_0_35,negated_conjecture,
    sk1 = sk3,
    co1_6 ).

cnf(c_0_36,negated_conjecture,
    ( sk6 = nil
    | sk4 != nil
    | ~ ssList(app(sk5,sk3)) ),
    inference(cn,[status(thm)],[inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_31,c_0_32]),c_0_33])]) ).

cnf(c_0_37,axiom,
    ( ssList(app(X2,X1))
    | ~ ssList(X1)
    | ~ ssList(X2) ),
    clause85 ).

cnf(c_0_38,negated_conjecture,
    ssList(sk5),
    co1_7 ).

cnf(c_0_39,negated_conjecture,
    ssList(sk3),
    inference(rw,[status(thm)],[c_0_34,c_0_35]) ).

cnf(c_0_40,negated_conjecture,
    ( sk6 = nil
    | sk4 != nil ),
    inference(cn,[status(thm)],[inference(rw,[status(thm)],[inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_36,c_0_37]),c_0_38]),c_0_39])]) ).

cnf(c_0_41,axiom,
    ( app(X1,nil) = X1
    | ~ ssList(X1) ),
    clause73 ).

cnf(c_0_42,negated_conjecture,
    ( app(app(sk5,sk3),nil) = sk4
    | sk4 != nil ),
    inference(spm,[status(thm)],[c_0_32,c_0_40]) ).

cnf(c_0_43,axiom,
    ( nil = X1
    | app(X1,X2) != nil
    | ~ ssList(X2)
    | ~ ssList(X1) ),
    clause118 ).

cnf(c_0_44,negated_conjecture,
    ( app(sk5,sk3) = sk4
    | sk4 != nil
    | ~ ssList(app(sk5,sk3)) ),
    inference(spm,[status(thm)],[c_0_41,c_0_42]) ).

cnf(c_0_45,negated_conjecture,
    ( app(sk5,sk3) = nil
    | sk4 != nil
    | ~ ssList(app(sk5,sk3)) ),
    inference(cn,[status(thm)],[inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_43,c_0_32]),c_0_33])]) ).

cnf(c_0_46,negated_conjecture,
    ( app(sk5,sk3) = sk4
    | sk4 != nil ),
    inference(cn,[status(thm)],[inference(rw,[status(thm)],[inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_44,c_0_37]),c_0_38]),c_0_39])]) ).

cnf(c_0_47,negated_conjecture,
    ( app(sk5,sk3) = nil
    | sk4 != nil ),
    inference(cn,[status(thm)],[inference(rw,[status(thm)],[inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_45,c_0_37]),c_0_38]),c_0_39])]) ).

cnf(c_0_48,negated_conjecture,
    ( app(sk4,sk6) = sk4
    | sk4 != nil ),
    inference(spm,[status(thm)],[c_0_32,c_0_46]) ).

cnf(c_0_49,negated_conjecture,
    ( nil = sk4
    | nil != sk3 ),
    co1_16 ).

cnf(c_0_50,negated_conjecture,
    ( sk5 = nil
    | sk4 != nil ),
    inference(cn,[status(thm)],[inference(rw,[status(thm)],[inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_43,c_0_47]),c_0_39]),c_0_38])]) ).

cnf(c_0_51,negated_conjecture,
    ( app(nil,sk6) = nil
    | sk3 != nil ),
    inference(spm,[status(thm)],[c_0_48,c_0_49]) ).

cnf(c_0_52,axiom,
    ssList(nil),
    clause8 ).

cnf(c_0_53,axiom,
    ( app(app(X3,X2),X1) = app(X3,app(X2,X1))
    | ~ ssList(X1)
    | ~ ssList(X2)
    | ~ ssList(X3) ),
    clause149 ).

cnf(c_0_54,negated_conjecture,
    ( app(app(nil,sk3),sk6) = sk4
    | sk4 != nil ),
    inference(spm,[status(thm)],[c_0_32,c_0_50]) ).

cnf(c_0_55,axiom,
    ( app(nil,X1) = X1
    | ~ ssList(X1) ),
    clause74 ).

cnf(c_0_56,negated_conjecture,
    ( sk6 = nil
    | sk3 != nil ),
    inference(cn,[status(thm)],[inference(rw,[status(thm)],[inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_31,c_0_51]),c_0_33]),c_0_52])]) ).

cnf(c_0_57,negated_conjecture,
    app(sk5,app(sk3,sk6)) = sk4,
    inference(cn,[status(thm)],[inference(rw,[status(thm)],[inference(rw,[status(thm)],[inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_32,c_0_53]),c_0_38]),c_0_39]),c_0_33])]) ).

cnf(c_0_58,negated_conjecture,
    ( app(sk3,sk6) = sk4
    | sk4 != nil ),
    inference(cn,[status(thm)],[inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_54,c_0_55]),c_0_39])]) ).

cnf(c_0_59,negated_conjecture,
    ( app(app(sk5,sk3),nil) = sk4
    | sk3 != nil ),
    inference(spm,[status(thm)],[c_0_32,c_0_56]) ).

cnf(c_0_60,negated_conjecture,
    ( app(sk5,sk4) = sk4
    | sk4 != nil ),
    inference(spm,[status(thm)],[c_0_57,c_0_58]) ).

cnf(c_0_61,negated_conjecture,
    ( app(sk5,sk3) = sk4
    | sk3 != nil
    | ~ ssList(app(sk5,sk3)) ),
    inference(spm,[status(thm)],[c_0_41,c_0_59]) ).

cnf(c_0_62,negated_conjecture,
    ( app(sk5,nil) = nil
    | sk3 != nil ),
    inference(spm,[status(thm)],[c_0_60,c_0_49]) ).

cnf(c_0_63,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_64,negated_conjecture,
    ( app(sk5,sk3) = sk4
    | sk3 != nil ),
    inference(cn,[status(thm)],[inference(rw,[status(thm)],[inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_61,c_0_37]),c_0_38]),c_0_39])]) ).

cnf(c_0_65,negated_conjecture,
    ( sk5 = nil
    | sk3 != nil ),
    inference(cn,[status(thm)],[inference(rw,[status(thm)],[inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_43,c_0_62]),c_0_52]),c_0_38])]) ).

cnf(c_0_66,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_63]) ).

cnf(c_0_67,axiom,
    ( app(skaf42(X1,X2),cons(X2,skaf43(X2,X1))) = X1
    | ~ memberP(X1,X2)
    | ~ ssItem(X2)
    | ~ ssList(X1) ),
    clause169 ).

cnf(c_0_68,axiom,
    ssList(skaf43(X1,X2)),
    clause52 ).

cnf(c_0_69,axiom,
    ssList(skaf42(X1,X2)),
    clause53 ).

cnf(c_0_70,axiom,
    ( memberP(cons(X2,X3),X1)
    | X1 != X2
    | ~ ssList(X3)
    | ~ ssItem(X2)
    | ~ ssItem(X1) ),
    clause138 ).

cnf(c_0_71,axiom,
    ( duplicatefreeP(X1)
    | ssItem(X2)
    | ~ ssList(X1) ),
    clause72 ).

cnf(c_0_72,negated_conjecture,
    ssList(sk2),
    co1_2 ).

cnf(c_0_73,negated_conjecture,
    sk2 = sk4,
    co1_5 ).

cnf(c_0_74,negated_conjecture,
    ~ memberP(sk2,sk7),
    co1_15 ).

cnf(c_0_75,negated_conjecture,
    ( app(nil,sk3) = sk4
    | sk3 != nil ),
    inference(spm,[status(thm)],[c_0_64,c_0_65]) ).

cnf(c_0_76,negated_conjecture,
    memberP(sk1,sk7),
    co1_14 ).

cnf(c_0_77,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_66,c_0_67]),c_0_68]),c_0_69])]) ).

cnf(c_0_78,axiom,
    ( cons(skaf83(X1),skaf82(X1)) = X1
    | nil = X1
    | ~ ssList(X1) ),
    clause109 ).

cnf(c_0_79,axiom,
    ssItem(skaf83(X1)),
    clause12 ).

cnf(c_0_80,axiom,
    ssList(skaf82(X1)),
    clause13 ).

cnf(c_0_81,plain,
    ( memberP(cons(X1,X2),X1)
    | ~ ssItem(X1)
    | ~ ssList(X2) ),
    inference(er,[status(thm)],[c_0_70]) ).

cnf(c_0_82,plain,
    ( ssItem(X1)
    | duplicatefreeP(app(X2,X3))
    | ~ ssList(X2)
    | ~ ssList(X3) ),
    inference(spm,[status(thm)],[c_0_71,c_0_37]) ).

cnf(c_0_83,negated_conjecture,
    ssList(sk4),
    inference(rw,[status(thm)],[c_0_72,c_0_73]) ).

cnf(c_0_84,negated_conjecture,
    ( app(sk3,sk6) = nil
    | sk4 != nil
    | ~ ssList(app(sk3,sk6)) ),
    inference(cn,[status(thm)],[inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_31,c_0_57]),c_0_38])]) ).

cnf(c_0_85,negated_conjecture,
    ~ memberP(sk4,sk7),
    inference(rw,[status(thm)],[c_0_74,c_0_73]) ).

cnf(c_0_86,negated_conjecture,
    ( sk4 = sk3
    | sk3 != nil ),
    inference(cn,[status(thm)],[inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_55,c_0_75]),c_0_39])]) ).

cnf(c_0_87,negated_conjecture,
    memberP(sk3,sk7),
    inference(rw,[status(thm)],[c_0_76,c_0_35]) ).

cnf(c_0_88,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_77,c_0_78]),c_0_79]),c_0_80])]),c_0_37]) ).

cnf(c_0_89,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_81,c_0_78]),c_0_79]),c_0_80])]) ).

cnf(c_0_90,negated_conjecture,
    ( ssItem(X1)
    | duplicatefreeP(app(sk4,X2))
    | ~ ssList(X2) ),
    inference(spm,[status(thm)],[c_0_82,c_0_83]) ).

cnf(c_0_91,negated_conjecture,
    ( app(sk3,sk6) = nil
    | sk4 != nil ),
    inference(cn,[status(thm)],[inference(rw,[status(thm)],[inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_84,c_0_37]),c_0_39]),c_0_33])]) ).

cnf(c_0_92,negated_conjecture,
    sk3 != nil,
    inference(cn,[status(thm)],[inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_85,c_0_86]),c_0_87])]) ).

cnf(c_0_93,plain,
    ( nil = X1
    | ~ ssList(X1)
    | ~ duplicatefreeP(app(X1,X1)) ),
    inference(spm,[status(thm)],[c_0_88,c_0_89]) ).

cnf(c_0_94,negated_conjecture,
    ( ssItem(X1)
    | duplicatefreeP(app(sk4,sk4)) ),
    inference(spm,[status(thm)],[c_0_90,c_0_83]) ).

cnf(c_0_95,negated_conjecture,
    sk4 != nil,
    inference(sr,[status(thm)],[inference(cn,[status(thm)],[inference(rw,[status(thm)],[inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_43,c_0_91]),c_0_33]),c_0_39])]),c_0_92]) ).

cnf(c_0_96,axiom,
    ( memberP(app(X1,X3),X2)
    | ~ memberP(X1,X2)
    | ~ ssList(X3)
    | ~ ssList(X1)
    | ~ ssItem(X2) ),
    clause140 ).

cnf(c_0_97,axiom,
    ( app(X2,skaf45(X1,X2)) = X1
    | ~ frontsegP(X1,X2)
    | ~ ssList(X2)
    | ~ ssList(X1) ),
    clause132 ).

cnf(c_0_98,axiom,
    ssList(skaf45(X1,X2)),
    clause51 ).

cnf(c_0_99,axiom,
    ( memberP(app(X3,X1),X2)
    | ~ memberP(X1,X2)
    | ~ ssList(X1)
    | ~ ssList(X3)
    | ~ ssItem(X2) ),
    clause141 ).

cnf(c_0_100,negated_conjecture,
    ssItem(X1),
    inference(sr,[status(thm)],[inference(cn,[status(thm)],[inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_93,c_0_94]),c_0_83])]),c_0_95]) ).

cnf(c_0_101,plain,
    ( memberP(X1,X2)
    | ~ memberP(X3,X2)
    | ~ frontsegP(X1,X3)
    | ~ ssItem(X2)
    | ~ ssList(X3)
    | ~ ssList(X1) ),
    inference(cn,[status(thm)],[inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_96,c_0_97]),c_0_98])]) ).

cnf(c_0_102,plain,
    ( memberP(app(X1,X2),X3)
    | ~ memberP(X2,X3)
    | ~ ssList(X1)
    | ~ ssList(X2) ),
    inference(cn,[status(thm)],[inference(rw,[status(thm)],[c_0_99,c_0_100])]) ).

cnf(c_0_103,plain,
    ( memberP(X1,X2)
    | ~ memberP(X3,X2)
    | ~ frontsegP(X1,X3)
    | ~ ssList(X3)
    | ~ ssList(X1) ),
    inference(cn,[status(thm)],[inference(rw,[status(thm)],[c_0_101,c_0_100])]) ).

cnf(c_0_104,negated_conjecture,
    ( memberP(sk4,X1)
    | ~ memberP(app(sk3,sk6),X1)
    | ~ ssList(app(sk3,sk6)) ),
    inference(cn,[status(thm)],[inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_102,c_0_57]),c_0_38])]) ).

cnf(c_0_105,negated_conjecture,
    ( memberP(X1,sk7)
    | ~ frontsegP(X1,sk3)
    | ~ ssList(X1) ),
    inference(cn,[status(thm)],[inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_103,c_0_87]),c_0_39])]) ).

cnf(c_0_106,axiom,
    ( frontsegP(X3,X1)
    | app(X1,X2) != X3
    | ~ ssList(X2)
    | ~ ssList(X1)
    | ~ ssList(X3) ),
    clause144 ).

cnf(c_0_107,negated_conjecture,
    ( ~ frontsegP(app(sk3,sk6),sk3)
    | ~ ssList(app(sk3,sk6)) ),
    inference(sr,[status(thm)],[inference(spm,[status(thm)],[c_0_104,c_0_105]),c_0_85]) ).

cnf(c_0_108,plain,
    ( frontsegP(app(X1,X2),X1)
    | ~ ssList(X2)
    | ~ ssList(X1) ),
    inference(csr,[status(thm)],[inference(er,[status(thm)],[c_0_106]),c_0_37]) ).

cnf(c_0_109,negated_conjecture,
    ~ ssList(app(sk3,sk6)),
    inference(cn,[status(thm)],[inference(rw,[status(thm)],[inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_107,c_0_108]),c_0_33]),c_0_39])]) ).

cnf(c_0_110,negated_conjecture,
    $false,
    inference(cn,[status(thm)],[inference(rw,[status(thm)],[inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_109,c_0_37]),c_0_39]),c_0_33])]),
    [proof] ).

%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.00/0.12  % Problem    : SWC404-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.16/0.33  % Computer : n003.cluster.edu
% 0.16/0.33  % Model    : x86_64 x86_64
% 0.16/0.33  % CPU      : Intel(R) Xeon(R) CPU E5-2620 v4 @ 2.10GHz
% 0.16/0.33  % Memory   : 8042.1875MB
% 0.16/0.33  % OS       : Linux 3.10.0-693.el7.x86_64
% 0.16/0.33  % CPULimit   : 300
% 0.16/0.33  % WCLimit    : 300
% 0.16/0.33  % DateTime   : Tue May  5 04:48:41 EDT 2026
% 0.16/0.33  % CPUTime    : 
% 0.16/0.34  % start to proof: theBenchmark
% 2.09/1.94  % Version  : CSE_E---1.7
% 2.09/1.94  % Problem  : theBenchmark.p
% 2.09/1.94  % SZS status Unsatisfiable for theBenchmark.p
% 2.09/1.94  % SZS output start CNFRefutation
% See solution above
% 2.09/1.94  % Total time : 1.367s
%------------------------------------------------------------------------------