↑ Up

CSE_E---1.7.UNS-CRf.s

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

% Result   : Unsatisfiable 3.99s 3.20s
% Output   : CNFRefutation 3.99s
% Verified : 
% SZS Type : Refutation
%            Derivation depth      :    9
%            Number of leaves      :   17
% Syntax   : Number of clauses     :   46 (  26 unt;   2 nHn;  46 RR)
%            Number of literals    :  103 (  19 equ;  60 neg)
%            Maximal clause size   :    9 (   2 avg)
%            Maximal term depth    :    5 (   1 avg)
%            Number of predicates  :    7 (   5 usr;   1 prp; 0-2 aty)
%            Number of functors    :    9 (   9 usr;   7 con; 0-2 aty)
%            Number of variables   :   45 (   0 sgn)

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

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

cnf(co1_18,negated_conjecture,
    ~ neq(sk7,sk8),
    file('/export/starexec/sandbox2/benchmark/theBenchmark.p',co1_18) ).

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

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

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

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

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

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

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(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_1,negated_conjecture,
    ssList(sk1),
    file('/export/starexec/sandbox2/benchmark/theBenchmark.p',co1_1) ).

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

cnf(co1_10,negated_conjecture,
    strictorderedP(sk3),
    file('/export/starexec/sandbox2/benchmark/theBenchmark.p',co1_10) ).

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

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

cnf(c_0_17,negated_conjecture,
    app(app(app(sk9,cons(sk7,nil)),cons(sk8,nil)),sk10) = sk1,
    co1_17 ).

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

cnf(c_0_19,negated_conjecture,
    ~ neq(sk7,sk8),
    co1_18 ).

cnf(c_0_20,axiom,
    ( neq(X2,X1)
    | X2 = X1
    | ~ ssItem(X1)
    | ~ ssItem(X2) ),
    clause102 ).

cnf(c_0_21,negated_conjecture,
    ssItem(sk7),
    co1_13 ).

cnf(c_0_22,negated_conjecture,
    ssItem(sk8),
    co1_14 ).

cnf(c_0_23,negated_conjecture,
    app(app(app(sk9,cons(sk7,nil)),cons(sk8,nil)),sk10) = sk3,
    inference(rw,[status(thm)],[c_0_17,c_0_18]) ).

cnf(c_0_24,negated_conjecture,
    sk8 = sk7,
    inference(cn,[status(thm)],[inference(rw,[status(thm)],[inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_19,c_0_20]),c_0_21]),c_0_22])]) ).

cnf(c_0_25,negated_conjecture,
    app(app(app(sk9,cons(sk7,nil)),cons(sk7,nil)),sk10) = sk3,
    inference(rw,[status(thm)],[c_0_23,c_0_24]) ).

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

cnf(c_0_27,negated_conjecture,
    ssList(sk9),
    co1_15 ).

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

cnf(c_0_29,negated_conjecture,
    ( app(app(sk9,app(cons(sk7,nil),cons(sk7,nil))),sk10) = sk3
    | ~ ssList(cons(sk7,nil)) ),
    inference(cn,[status(thm)],[inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_25,c_0_26]),c_0_27])]) ).

cnf(c_0_30,plain,
    ( app(app(X1,app(X2,X3)),X4) = app(app(X1,X2),app(X3,X4))
    | ~ ssList(X3)
    | ~ ssList(X4)
    | ~ ssList(X1)
    | ~ ssList(X2) ),
    inference(csr,[status(thm)],[inference(spm,[status(thm)],[c_0_26,c_0_26]),c_0_28]) ).

cnf(c_0_31,negated_conjecture,
    ssList(sk10),
    co1_16 ).

cnf(c_0_32,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_33,negated_conjecture,
    ( app(app(sk9,cons(sk7,nil)),app(cons(sk7,nil),sk10)) = sk3
    | ~ ssList(cons(sk7,nil)) ),
    inference(cn,[status(thm)],[inference(rw,[status(thm)],[inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_29,c_0_30]),c_0_31]),c_0_27])]) ).

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

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

cnf(c_0_36,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_32]) ).

cnf(c_0_37,negated_conjecture,
    ( app(app(sk9,cons(sk7,nil)),cons(sk7,sk10)) = sk3
    | ~ ssList(cons(sk7,nil)) ),
    inference(cn,[status(thm)],[inference(rw,[status(thm)],[inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_33,c_0_34]),c_0_21]),c_0_31])]) ).

cnf(c_0_38,negated_conjecture,
    ssList(sk3),
    inference(rw,[status(thm)],[c_0_35,c_0_18]) ).

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

cnf(c_0_40,negated_conjecture,
    strictorderedP(sk3),
    co1_10 ).

cnf(c_0_41,axiom,
    ( ~ lt(X1,X1)
    | ~ ssItem(X1) ),
    clause63 ).

cnf(c_0_42,negated_conjecture,
    ( lt(sk7,sk7)
    | ~ ssList(cons(sk7,nil)) ),
    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(spm,[status(thm)],[c_0_36,c_0_37]),c_0_21]),c_0_38]),c_0_31]),c_0_39]),c_0_27]),c_0_40])]) ).

cnf(c_0_43,negated_conjecture,
    ~ ssList(cons(sk7,nil)),
    inference(cn,[status(thm)],[inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_41,c_0_42]),c_0_21])]) ).

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

cnf(c_0_45,negated_conjecture,
    $false,
    inference(cn,[status(thm)],[inference(rw,[status(thm)],[inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_43,c_0_44]),c_0_21]),c_0_39])]),
    [proof] ).

%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.12/0.13  % Problem    : SWC176-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 : n026.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:32:08 EDT 2026
% 0.15/0.34  % CPUTime    : 
% 0.20/0.35  % start to proof: theBenchmark
% 3.99/3.20  % Version  : CSE_E---1.7
% 3.99/3.20  % Problem  : theBenchmark.p
% 3.99/3.20  % SZS status Unsatisfiable for theBenchmark.p
% 3.99/3.20  % SZS output start CNFRefutation
% See solution above
% 3.99/3.22  % Total time : 2.373s
%------------------------------------------------------------------------------