↑ Up

CSE_E---1.7.UNS-CRf.s

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

% Result   : Unsatisfiable 1.44s 1.77s
% Output   : CNFRefutation 1.44s
% Verified : 
% SZS Type : Refutation
%            Derivation depth      :   16
%            Number of leaves      :   22
% Syntax   : Number of clauses     :   67 (  27 unt;   5 nHn;  67 RR)
%            Number of literals    :  167 (  47 equ; 105 neg)
%            Maximal clause size   :    9 (   2 avg)
%            Maximal term depth    :    6 (   1 avg)
%            Number of predicates  :    6 (   4 usr;   1 prp; 0-2 aty)
%            Number of functors    :   11 (  11 usr;   9 con; 0-2 aty)
%            Number of variables   :   53 (   0 sgn)

% Comments : 
%------------------------------------------------------------------------------
cnf(co1_12,negated_conjecture,
    app(app(app(app(sk7,cons(sk5,nil)),sk8),cons(sk6,nil)),sk9) = sk1,
    file('/export/starexec/sandbox2/benchmark/theBenchmark.p',co1_12) ).

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

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_11,negated_conjecture,
    ssList(sk9),
    file('/export/starexec/sandbox2/benchmark/theBenchmark.p',co1_11) ).

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

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_10,negated_conjecture,
    ssList(sk8),
    file('/export/starexec/sandbox2/benchmark/theBenchmark.p',co1_10) ).

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

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

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

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

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(co1_7,negated_conjecture,
    ssItem(sk5),
    file('/export/starexec/sandbox2/benchmark/theBenchmark.p',co1_7) ).

cnf(clause66,axiom,
    ( strictorderedP(cons(X1,nil))
    | ~ ssItem(X1) ),
    file('/export/starexec/sandbox2/benchmark/Axioms/SWC001-0.ax',clause66) ).

cnf(co1_18,negated_conjecture,
    ( cons(sk10,nil) = sk3
    | nil = sk3 ),
    file('/export/starexec/sandbox2/benchmark/theBenchmark.p',co1_18) ).

cnf(co1_15,negated_conjecture,
    ( ssItem(sk10)
    | nil = sk3 ),
    file('/export/starexec/sandbox2/benchmark/theBenchmark.p',co1_15) ).

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

cnf(clause181,axiom,
    ( lt(X2,X4)
    | app(app(X1,cons(X2,X3)),cons(X4,X5)) != X6
    | ~ ssList(X5)
    | ~ ssList(X3)
    | ~ ssList(X1)
    | ~ ssItem(X4)
    | ~ ssItem(X2)
    | ~ strictorderedP(X6)
    | ~ ssList(X6) ),
    file('/export/starexec/sandbox2/benchmark/Axioms/SWC001-0.ax',clause181) ).

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

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

cnf(co1_13,negated_conjecture,
    lt(sk6,sk5),
    file('/export/starexec/sandbox2/benchmark/theBenchmark.p',co1_13) ).

cnf(c_0_22,negated_conjecture,
    app(app(app(app(sk7,cons(sk5,nil)),sk8),cons(sk6,nil)),sk9) = sk1,
    co1_12 ).

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

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

cnf(c_0_25,negated_conjecture,
    app(app(app(app(sk7,cons(sk5,nil)),sk8),cons(sk6,nil)),sk9) = sk3,
    inference(rw,[status(thm)],[c_0_22,c_0_23]) ).

cnf(c_0_26,negated_conjecture,
    ssList(sk9),
    co1_11 ).

cnf(c_0_27,negated_conjecture,
    ( app(app(app(sk7,cons(sk5,nil)),sk8),cons(sk6,nil)) = nil
    | sk3 != nil
    | ~ ssList(app(app(app(sk7,cons(sk5,nil)),sk8),cons(sk6,nil))) ),
    inference(cn,[status(thm)],[inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_24,c_0_25]),c_0_26])]) ).

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

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

cnf(c_0_30,negated_conjecture,
    ( app(app(app(sk7,cons(sk5,nil)),sk8),cons(sk6,nil)) = nil
    | sk3 != nil
    | ~ ssList(app(app(sk7,cons(sk5,nil)),sk8))
    | ~ ssList(cons(sk6,nil)) ),
    inference(spm,[status(thm)],[c_0_27,c_0_28]) ).

cnf(c_0_31,negated_conjecture,
    ( cons(sk6,nil) = nil
    | sk3 != nil
    | ~ ssList(app(app(sk7,cons(sk5,nil)),sk8))
    | ~ ssList(cons(sk6,nil)) ),
    inference(spm,[status(thm)],[c_0_29,c_0_30]) ).

cnf(c_0_32,negated_conjecture,
    ssList(sk8),
    co1_10 ).

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

cnf(c_0_34,negated_conjecture,
    ssList(sk7),
    co1_9 ).

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

cnf(c_0_36,negated_conjecture,
    ( cons(sk6,nil) = nil
    | sk3 != nil
    | ~ ssList(cons(sk6,nil))
    | ~ ssList(cons(sk5,nil)) ),
    inference(cn,[status(thm)],[inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_33,c_0_28]),c_0_34])]) ).

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

cnf(c_0_38,negated_conjecture,
    ssItem(sk6),
    co1_8 ).

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

cnf(c_0_40,negated_conjecture,
    ( app(app(app(sk7,app(cons(sk5,nil),sk8)),cons(sk6,nil)),sk9) = sk3
    | ~ ssList(cons(sk5,nil)) ),
    inference(cn,[status(thm)],[inference(rw,[status(thm)],[inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_25,c_0_35]),c_0_34]),c_0_32])]) ).

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

cnf(c_0_42,negated_conjecture,
    ssItem(sk5),
    co1_7 ).

cnf(c_0_43,negated_conjecture,
    ( cons(sk6,nil) = nil
    | sk3 != nil
    | ~ ssList(cons(sk5,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_44,negated_conjecture,
    ( app(app(app(sk7,cons(sk5,sk8)),cons(sk6,nil)),sk9) = sk3
    | ~ ssList(cons(sk5,nil)) ),
    inference(cn,[status(thm)],[inference(rw,[status(thm)],[inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_40,c_0_41]),c_0_42]),c_0_32])]) ).

cnf(c_0_45,axiom,
    ( strictorderedP(cons(X1,nil))
    | ~ ssItem(X1) ),
    clause66 ).

cnf(c_0_46,negated_conjecture,
    ( cons(sk10,nil) = sk3
    | nil = sk3 ),
    co1_18 ).

cnf(c_0_47,negated_conjecture,
    ( ssItem(sk10)
    | nil = sk3 ),
    co1_15 ).

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

cnf(c_0_49,negated_conjecture,
    ( cons(sk6,nil) = nil
    | sk3 != nil ),
    inference(cn,[status(thm)],[inference(rw,[status(thm)],[inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_43,c_0_37]),c_0_42]),c_0_39])]) ).

cnf(c_0_50,axiom,
    ( lt(X2,X4)
    | app(app(X1,cons(X2,X3)),cons(X4,X5)) != X6
    | ~ ssList(X5)
    | ~ ssList(X3)
    | ~ ssList(X1)
    | ~ ssItem(X4)
    | ~ ssItem(X2)
    | ~ strictorderedP(X6)
    | ~ ssList(X6) ),
    clause181 ).

cnf(c_0_51,negated_conjecture,
    ( app(app(sk7,cons(sk5,sk8)),app(cons(sk6,nil),sk9)) = sk3
    | ~ ssList(app(sk7,cons(sk5,sk8)))
    | ~ ssList(cons(sk6,nil))
    | ~ ssList(cons(sk5,nil)) ),
    inference(cn,[status(thm)],[inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_35,c_0_44]),c_0_26])]) ).

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

cnf(c_0_53,negated_conjecture,
    ( sk3 = nil
    | strictorderedP(sk3) ),
    inference(csr,[status(thm)],[inference(spm,[status(thm)],[c_0_45,c_0_46]),c_0_47]) ).

cnf(c_0_54,negated_conjecture,
    sk3 != nil,
    inference(cn,[status(thm)],[inference(rw,[status(thm)],[inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_48,c_0_49]),c_0_38]),c_0_39])]) ).

cnf(c_0_55,axiom,
    ( ~ lt(X1,X2)
    | ~ lt(X2,X1)
    | ~ ssItem(X1)
    | ~ ssItem(X2) ),
    clause114 ).

cnf(c_0_56,negated_conjecture,
    lt(sk6,sk5),
    co1_13 ).

cnf(c_0_57,plain,
    ( lt(X1,X2)
    | ~ ssItem(X2)
    | ~ ssItem(X1)
    | ~ ssList(app(app(X3,cons(X1,X4)),cons(X2,X5)))
    | ~ ssList(X5)
    | ~ ssList(X4)
    | ~ ssList(X3)
    | ~ strictorderedP(app(app(X3,cons(X1,X4)),cons(X2,X5))) ),
    inference(er,[status(thm)],[c_0_50]) ).

cnf(c_0_58,negated_conjecture,
    ( app(app(sk7,cons(sk5,sk8)),cons(sk6,sk9)) = sk3
    | ~ ssList(app(sk7,cons(sk5,sk8)))
    | ~ ssList(cons(sk6,nil))
    | ~ ssList(cons(sk5,nil)) ),
    inference(cn,[status(thm)],[inference(rw,[status(thm)],[inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_51,c_0_41]),c_0_38]),c_0_26])]) ).

cnf(c_0_59,negated_conjecture,
    ssList(sk3),
    inference(rw,[status(thm)],[c_0_52,c_0_23]) ).

cnf(c_0_60,negated_conjecture,
    strictorderedP(sk3),
    inference(sr,[status(thm)],[c_0_53,c_0_54]) ).

cnf(c_0_61,negated_conjecture,
    ~ lt(sk5,sk6),
    inference(cn,[status(thm)],[inference(rw,[status(thm)],[inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_55,c_0_56]),c_0_38]),c_0_42])]) ).

cnf(c_0_62,negated_conjecture,
    ( ~ ssList(app(sk7,cons(sk5,sk8)))
    | ~ ssList(cons(sk6,nil))
    | ~ ssList(cons(sk5,nil)) ),
    inference(sr,[status(thm)],[inference(cn,[status(thm)],[inference(rw,[status(thm)],[inference(rw,[status(thm)],[inference(rw,[status(thm)],[inference(rw,[status(thm)],[inference(rw,[status(thm)],[inference(rw,[status(thm)],[inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_57,c_0_58]),c_0_38]),c_0_42]),c_0_59]),c_0_26]),c_0_32]),c_0_34]),c_0_60])]),c_0_61]) ).

cnf(c_0_63,negated_conjecture,
    ( ~ ssList(cons(sk6,nil))
    | ~ ssList(cons(sk5,nil))
    | ~ ssList(cons(sk5,sk8)) ),
    inference(cn,[status(thm)],[inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_62,c_0_28]),c_0_34])]) ).

cnf(c_0_64,negated_conjecture,
    ( ~ ssList(cons(sk5,nil))
    | ~ ssList(cons(sk5,sk8)) ),
    inference(cn,[status(thm)],[inference(rw,[status(thm)],[inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_63,c_0_37]),c_0_38]),c_0_39])]) ).

cnf(c_0_65,negated_conjecture,
    ~ ssList(cons(sk5,nil)),
    inference(cn,[status(thm)],[inference(rw,[status(thm)],[inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_64,c_0_37]),c_0_42]),c_0_32])]) ).

cnf(c_0_66,negated_conjecture,
    $false,
    inference(cn,[status(thm)],[inference(rw,[status(thm)],[inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_65,c_0_37]),c_0_42]),c_0_39])]),
    [proof] ).

%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.00/0.12  % Problem    : SWC306-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 : n002.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:43:01 EDT 2026
% 0.16/0.33  % CPUTime    : 
% 0.16/0.34  % start to proof: theBenchmark
% 1.44/1.77  % Version  : CSE_E---1.7
% 1.44/1.77  % Problem  : theBenchmark.p
% 1.44/1.77  % SZS status Unsatisfiable for theBenchmark.p
% 1.44/1.77  % SZS output start CNFRefutation
% See solution above
% 1.44/1.78  % Total time : 1.368s
%------------------------------------------------------------------------------