↑ Up

CSE_E---1.7.UNS-CRf.s

View TPTP
Problem
Process solution in
SystemOnTSTP
Download .tgz
%------------------------------------------------------------------------------
% File     : CSE_E---1.7
% Problem  : SWC315-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 : n009.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:09 PM UTC 2026

% Result   : Unsatisfiable 1.31s 1.74s
% Output   : CNFRefutation 1.31s
% Verified : 
% SZS Type : Refutation
%            Derivation depth      :   18
%            Number of leaves      :   24
% Syntax   : Number of clauses     :   80 (  26 unt;  11 nHn;  80 RR)
%            Number of literals    :  160 (  86 equ;  73 neg)
%            Maximal clause size   :    4 (   2 avg)
%            Maximal term depth    :    3 (   1 avg)
%            Number of predicates  :    5 (   3 usr;   1 prp; 0-2 aty)
%            Number of functors    :   13 (  13 usr;   9 con; 0-2 aty)
%            Number of variables   :   32 (   0 sgn)

% Comments : 
%------------------------------------------------------------------------------
cnf(co1_14,negated_conjecture,
    ( app(cons(sk5,nil),sk6) = sk2
    | nil != sk1 ),
    file('/export/starexec/sandbox2/benchmark/theBenchmark.p',co1_14) ).

cnf(co1_5,negated_conjecture,
    sk2 = sk4,
    file('/export/starexec/sandbox2/benchmark/theBenchmark.p',co1_5) ).

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

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

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_13,negated_conjecture,
    ( ssList(sk6)
    | nil != sk1 ),
    file('/export/starexec/sandbox2/benchmark/theBenchmark.p',co1_13) ).

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

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

cnf(co1_9,negated_conjecture,
    ( ssItem(sk5)
    | nil != sk1 ),
    file('/export/starexec/sandbox2/benchmark/theBenchmark.p',co1_9) ).

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

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

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

cnf(co1_11,negated_conjecture,
    ( app(cons(sk5,nil),sk6) = sk2
    | nil = sk2 ),
    file('/export/starexec/sandbox2/benchmark/theBenchmark.p',co1_11) ).

cnf(co1_8,negated_conjecture,
    ( ssItem(sk5)
    | nil = sk2 ),
    file('/export/starexec/sandbox2/benchmark/theBenchmark.p',co1_8) ).

cnf(co1_10,negated_conjecture,
    ( ssList(sk6)
    | nil = sk2 ),
    file('/export/starexec/sandbox2/benchmark/theBenchmark.p',co1_10) ).

cnf(co1_18,negated_conjecture,
    ( app(cons(sk7,nil),sk8) = sk4
    | ~ neq(sk4,nil) ),
    file('/export/starexec/sandbox2/benchmark/theBenchmark.p',co1_18) ).

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

cnf(co1_16,negated_conjecture,
    ( ssItem(sk7)
    | ~ neq(sk4,nil) ),
    file('/export/starexec/sandbox2/benchmark/theBenchmark.p',co1_16) ).

cnf(co1_17,negated_conjecture,
    ( ssList(sk8)
    | ~ neq(sk4,nil) ),
    file('/export/starexec/sandbox2/benchmark/theBenchmark.p',co1_17) ).

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

cnf(clause96,axiom,
    ( tl(cons(X1,X2)) = X2
    | ~ ssItem(X1)
    | ~ ssList(X2) ),
    file('/export/starexec/sandbox2/benchmark/Axioms/SWC001-0.ax',clause96) ).

cnf(co1_19,negated_conjecture,
    ( app(sk8,cons(sk7,nil)) = sk3
    | ~ neq(sk4,nil) ),
    file('/export/starexec/sandbox2/benchmark/theBenchmark.p',co1_19) ).

cnf(clause97,axiom,
    ( hd(cons(X1,X2)) = X1
    | ~ ssItem(X1)
    | ~ ssList(X2) ),
    file('/export/starexec/sandbox2/benchmark/Axioms/SWC001-0.ax',clause97) ).

cnf(co1_12,negated_conjecture,
    ( nil = sk2
    | app(sk6,cons(sk5,nil)) != sk1 ),
    file('/export/starexec/sandbox2/benchmark/theBenchmark.p',co1_12) ).

cnf(c_0_24,negated_conjecture,
    ( app(cons(sk5,nil),sk6) = sk2
    | nil != sk1 ),
    co1_14 ).

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

cnf(c_0_26,negated_conjecture,
    ( nil = sk3
    | nil != sk4 ),
    co1_7 ).

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

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

cnf(c_0_29,negated_conjecture,
    ( app(cons(sk5,nil),sk6) = sk4
    | sk1 != nil ),
    inference(rw,[status(thm)],[c_0_24,c_0_25]) ).

cnf(c_0_30,negated_conjecture,
    ( ssList(sk6)
    | nil != sk1 ),
    co1_13 ).

cnf(c_0_31,negated_conjecture,
    ( sk1 = nil
    | sk4 != nil ),
    inference(rw,[status(thm)],[c_0_26,c_0_27]) ).

cnf(c_0_32,negated_conjecture,
    ( sk6 = nil
    | sk4 != nil
    | ~ ssList(cons(sk5,nil)) ),
    inference(csr,[status(thm)],[inference(csr,[status(thm)],[inference(spm,[status(thm)],[c_0_28,c_0_29]),c_0_30]),c_0_31]) ).

cnf(c_0_33,axiom,
    ( ssList(cons(X1,X2))
    | ~ ssItem(X1)
    | ~ ssList(X2) ),
    clause86 ).

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

cnf(c_0_35,negated_conjecture,
    ( sk6 = nil
    | sk4 != nil
    | ~ ssItem(sk5) ),
    inference(cn,[status(thm)],[inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_32,c_0_33]),c_0_34])]) ).

cnf(c_0_36,negated_conjecture,
    ( ssItem(sk5)
    | nil != sk1 ),
    co1_9 ).

cnf(c_0_37,negated_conjecture,
    ( sk6 = nil
    | sk4 != nil ),
    inference(csr,[status(thm)],[inference(spm,[status(thm)],[c_0_35,c_0_36]),c_0_31]) ).

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

cnf(c_0_39,negated_conjecture,
    ( app(cons(sk5,nil),nil) = sk4
    | sk4 != nil ),
    inference(csr,[status(thm)],[inference(spm,[status(thm)],[c_0_29,c_0_37]),c_0_31]) ).

cnf(c_0_40,negated_conjecture,
    ( cons(sk5,nil) = nil
    | sk4 != nil
    | ~ ssList(cons(sk5,nil)) ),
    inference(cn,[status(thm)],[inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_38,c_0_39]),c_0_34])]) ).

cnf(c_0_41,axiom,
    ( cons(X1,X2) != X2
    | ~ ssItem(X1)
    | ~ ssList(X2) ),
    clause99 ).

cnf(c_0_42,negated_conjecture,
    ( cons(sk5,nil) = nil
    | sk4 != nil
    | ~ ssItem(sk5) ),
    inference(cn,[status(thm)],[inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_40,c_0_33]),c_0_34])]) ).

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

cnf(c_0_44,negated_conjecture,
    ( sk4 != nil
    | ~ ssItem(sk5) ),
    inference(cn,[status(thm)],[inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_41,c_0_42]),c_0_34])]) ).

cnf(c_0_45,negated_conjecture,
    ( app(cons(sk5,nil),sk6) = sk2
    | nil = sk2 ),
    co1_11 ).

cnf(c_0_46,negated_conjecture,
    ( ssItem(sk5)
    | nil = sk2 ),
    co1_8 ).

cnf(c_0_47,negated_conjecture,
    ( ssList(sk6)
    | nil = sk2 ),
    co1_10 ).

cnf(c_0_48,negated_conjecture,
    ( app(cons(sk7,nil),sk8) = sk4
    | ~ neq(sk4,nil) ),
    co1_18 ).

cnf(c_0_49,axiom,
    ( neq(X2,X1)
    | X2 = X1
    | ~ ssList(X1)
    | ~ ssList(X2) ),
    clause100 ).

cnf(c_0_50,negated_conjecture,
    ssList(sk4),
    inference(rw,[status(thm)],[c_0_43,c_0_25]) ).

cnf(c_0_51,negated_conjecture,
    sk4 != nil,
    inference(csr,[status(thm)],[inference(spm,[status(thm)],[c_0_44,c_0_36]),c_0_31]) ).

cnf(c_0_52,negated_conjecture,
    ( ssItem(sk7)
    | ~ neq(sk4,nil) ),
    co1_16 ).

cnf(c_0_53,negated_conjecture,
    ( ssList(sk8)
    | ~ neq(sk4,nil) ),
    co1_17 ).

cnf(c_0_54,negated_conjecture,
    ( app(cons(sk5,nil),sk6) = sk4
    | sk4 = nil ),
    inference(rw,[status(thm)],[inference(rw,[status(thm)],[c_0_45,c_0_25]),c_0_25]) ).

cnf(c_0_55,negated_conjecture,
    ( sk4 = nil
    | ssItem(sk5) ),
    inference(rw,[status(thm)],[c_0_46,c_0_25]) ).

cnf(c_0_56,negated_conjecture,
    ( sk4 = nil
    | ssList(sk6) ),
    inference(rw,[status(thm)],[c_0_47,c_0_25]) ).

cnf(c_0_57,negated_conjecture,
    app(cons(sk7,nil),sk8) = sk4,
    inference(sr,[status(thm)],[inference(cn,[status(thm)],[inference(rw,[status(thm)],[inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_48,c_0_49]),c_0_50]),c_0_34])]),c_0_51]) ).

cnf(c_0_58,axiom,
    ( app(cons(X1,nil),X2) = cons(X1,X2)
    | ~ ssItem(X1)
    | ~ ssList(X2) ),
    clause120 ).

cnf(c_0_59,negated_conjecture,
    ssItem(sk7),
    inference(sr,[status(thm)],[inference(cn,[status(thm)],[inference(rw,[status(thm)],[inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_52,c_0_49]),c_0_50]),c_0_34])]),c_0_51]) ).

cnf(c_0_60,negated_conjecture,
    ssList(sk8),
    inference(sr,[status(thm)],[inference(cn,[status(thm)],[inference(rw,[status(thm)],[inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_53,c_0_49]),c_0_50]),c_0_34])]),c_0_51]) ).

cnf(c_0_61,negated_conjecture,
    app(cons(sk5,nil),sk6) = sk4,
    inference(sr,[status(thm)],[c_0_54,c_0_51]) ).

cnf(c_0_62,negated_conjecture,
    ssItem(sk5),
    inference(sr,[status(thm)],[c_0_55,c_0_51]) ).

cnf(c_0_63,negated_conjecture,
    ssList(sk6),
    inference(sr,[status(thm)],[c_0_56,c_0_51]) ).

cnf(c_0_64,axiom,
    ( tl(cons(X1,X2)) = X2
    | ~ ssItem(X1)
    | ~ ssList(X2) ),
    clause96 ).

cnf(c_0_65,negated_conjecture,
    cons(sk7,sk8) = sk4,
    inference(cn,[status(thm)],[inference(rw,[status(thm)],[inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_57,c_0_58]),c_0_59]),c_0_60])]) ).

cnf(c_0_66,negated_conjecture,
    cons(sk5,sk6) = sk4,
    inference(cn,[status(thm)],[inference(rw,[status(thm)],[inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_61,c_0_58]),c_0_62]),c_0_63])]) ).

cnf(c_0_67,negated_conjecture,
    tl(sk4) = sk8,
    inference(cn,[status(thm)],[inference(rw,[status(thm)],[inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_64,c_0_65]),c_0_59]),c_0_60])]) ).

cnf(c_0_68,negated_conjecture,
    ( app(sk8,cons(sk7,nil)) = sk3
    | ~ neq(sk4,nil) ),
    co1_19 ).

cnf(c_0_69,negated_conjecture,
    sk8 = sk6,
    inference(cn,[status(thm)],[inference(rw,[status(thm)],[inference(rw,[status(thm)],[inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_64,c_0_66]),c_0_67]),c_0_62]),c_0_63])]) ).

cnf(c_0_70,axiom,
    ( hd(cons(X1,X2)) = X1
    | ~ ssItem(X1)
    | ~ ssList(X2) ),
    clause97 ).

cnf(c_0_71,negated_conjecture,
    ( app(sk8,cons(sk7,nil)) = sk1
    | ~ neq(sk4,nil) ),
    inference(rw,[status(thm)],[c_0_68,c_0_27]) ).

cnf(c_0_72,negated_conjecture,
    cons(sk7,sk6) = sk4,
    inference(rw,[status(thm)],[c_0_65,c_0_69]) ).

cnf(c_0_73,negated_conjecture,
    hd(sk4) = sk5,
    inference(cn,[status(thm)],[inference(rw,[status(thm)],[inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_70,c_0_66]),c_0_62]),c_0_63])]) ).

cnf(c_0_74,negated_conjecture,
    ( nil = sk2
    | app(sk6,cons(sk5,nil)) != sk1 ),
    co1_12 ).

cnf(c_0_75,negated_conjecture,
    app(sk8,cons(sk7,nil)) = sk1,
    inference(sr,[status(thm)],[inference(cn,[status(thm)],[inference(rw,[status(thm)],[inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_71,c_0_49]),c_0_50]),c_0_34])]),c_0_51]) ).

cnf(c_0_76,negated_conjecture,
    sk7 = sk5,
    inference(cn,[status(thm)],[inference(rw,[status(thm)],[inference(rw,[status(thm)],[inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_70,c_0_72]),c_0_73]),c_0_59]),c_0_63])]) ).

cnf(c_0_77,negated_conjecture,
    ( sk4 = nil
    | app(sk6,cons(sk5,nil)) != sk1 ),
    inference(rw,[status(thm)],[c_0_74,c_0_25]) ).

cnf(c_0_78,negated_conjecture,
    app(sk6,cons(sk5,nil)) = sk1,
    inference(rw,[status(thm)],[inference(rw,[status(thm)],[c_0_75,c_0_69]),c_0_76]) ).

cnf(c_0_79,negated_conjecture,
    $false,
    inference(sr,[status(thm)],[inference(cn,[status(thm)],[inference(rw,[status(thm)],[c_0_77,c_0_78])]),c_0_51]),
    [proof] ).

%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.12/0.13  % Problem    : SWC315-1 : TPTP v9.2.1. Released v2.4.0.
% 0.12/0.13  % 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.15/0.34  % Computer : n009.cluster.edu
% 0.15/0.34  % Model    : x86_64 x86_64
% 0.15/0.34  % CPU      : Intel(R) Xeon(R) CPU E5-2620 v4 @ 2.10GHz
% 0.15/0.34  % Memory   : 8042.1875MB
% 0.15/0.34  % OS       : Linux 3.10.0-693.el7.x86_64
% 0.15/0.34  % CPULimit   : 300
% 0.15/0.34  % WCLimit    : 300
% 0.15/0.34  % DateTime   : Tue May  5 04:43:41 EDT 2026
% 0.15/0.34  % CPUTime    : 
% 0.20/0.35  % start to proof: theBenchmark
% 1.31/1.74  % Version  : CSE_E---1.7
% 1.31/1.74  % Problem  : theBenchmark.p
% 1.31/1.74  % SZS status Unsatisfiable for theBenchmark.p
% 1.31/1.74  % SZS output start CNFRefutation
% See solution above
% 1.31/1.74  % Total time : 1.369s
%------------------------------------------------------------------------------