↑ Up

CSE_E---1.7.UNS-CRf.s

View TPTP
Problem
Process solution in
SystemOnTSTP
Download .tgz
%------------------------------------------------------------------------------
% File     : CSE_E---1.7
% Problem  : SWC190-1 : TPTP v9.2.1. Released v2.4.0.
% Transfm  : none
% Format   : tptp:raw
% Command  : /export/starexec/sandbox/solver/bin/lemma_parallel_prover %s --lemma-prover /export/starexec/sandbox/solver/bin/cse --final-prover /export/starexec/sandbox/solver/bin/eprover --proof-time %d --global-time-limit %d

% Computer : n011.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:40 PM UTC 2026

% Result   : Unsatisfiable 1.21s 1.89s
% Output   : CNFRefutation 1.21s
% Verified : 
% SZS Type : Refutation
%            Derivation depth      :   14
%            Number of leaves      :   16
% Syntax   : Number of clauses     :   52 (  21 unt;   0 nHn;  52 RR)
%            Number of literals    :  129 (  28 equ;  83 neg)
%            Maximal clause size   :    6 (   2 avg)
%            Maximal term depth    :    5 (   1 avg)
%            Number of predicates  :    5 (   3 usr;   1 prp; 0-2 aty)
%            Number of functors    :   10 (  10 usr;   8 con; 0-2 aty)
%            Number of variables   :   39 (   0 sgn)

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

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

cnf(co1_10,negated_conjecture,
    ssList(sk8),
    file('/export/starexec/sandbox/benchmark/theBenchmark.p',co1_10) ).

cnf(clause175,axiom,
    ( memberP(X4,X2)
    | app(X1,cons(X2,X3)) != X4
    | ~ ssList(X3)
    | ~ ssList(X1)
    | ~ ssItem(X2)
    | ~ ssList(X4) ),
    file('/export/starexec/sandbox/benchmark/Axioms/SWC001-0.ax',clause175) ).

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

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

cnf(co1_14,negated_conjecture,
    ( sk9 = X1
    | ~ ssItem(X1)
    | ~ memberP(sk3,X1) ),
    file('/export/starexec/sandbox/benchmark/theBenchmark.p',co1_14) ).

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

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

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

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

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

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

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

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

cnf(co1_12,negated_conjecture,
    sk5 != sk6,
    file('/export/starexec/sandbox/benchmark/theBenchmark.p',co1_12) ).

cnf(c_0_16,negated_conjecture,
    app(app(app(sk7,cons(sk5,nil)),cons(sk6,nil)),sk8) = sk1,
    co1_11 ).

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

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

cnf(c_0_19,axiom,
    ( memberP(X4,X2)
    | app(X1,cons(X2,X3)) != X4
    | ~ ssList(X3)
    | ~ ssList(X1)
    | ~ ssItem(X2)
    | ~ ssList(X4) ),
    clause175 ).

cnf(c_0_20,negated_conjecture,
    ( app(app(sk7,cons(sk5,nil)),app(cons(sk6,nil),sk8)) = sk1
    | ~ ssList(app(sk7,cons(sk5,nil)))
    | ~ ssList(cons(sk6,nil)) ),
    inference(cn,[status(thm)],[inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_16,c_0_17]),c_0_18])]) ).

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

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

cnf(c_0_23,negated_conjecture,
    ( sk9 = X1
    | ~ ssItem(X1)
    | ~ memberP(sk3,X1) ),
    co1_14 ).

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

cnf(c_0_25,plain,
    ( memberP(app(X1,cons(X2,X3)),X2)
    | ~ ssItem(X2)
    | ~ ssList(app(X1,cons(X2,X3)))
    | ~ ssList(X3)
    | ~ ssList(X1) ),
    inference(er,[status(thm)],[c_0_19]) ).

cnf(c_0_26,negated_conjecture,
    ( app(app(sk7,cons(sk5,nil)),cons(sk6,sk8)) = sk1
    | ~ ssList(app(sk7,cons(sk5,nil)))
    | ~ ssList(cons(sk6,nil)) ),
    inference(cn,[status(thm)],[inference(rw,[status(thm)],[inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_20,c_0_21]),c_0_22]),c_0_18])]) ).

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

cnf(c_0_28,negated_conjecture,
    ( sk9 = X1
    | ~ memberP(sk1,X1)
    | ~ ssItem(X1) ),
    inference(rw,[status(thm)],[c_0_23,c_0_24]) ).

cnf(c_0_29,negated_conjecture,
    ( memberP(sk1,sk6)
    | ~ ssList(app(sk7,cons(sk5,nil)))
    | ~ ssList(cons(sk6,nil)) ),
    inference(cn,[status(thm)],[inference(rw,[status(thm)],[inference(rw,[status(thm)],[inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_25,c_0_26]),c_0_22]),c_0_27]),c_0_18])]) ).

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

cnf(c_0_31,negated_conjecture,
    ( sk9 = sk6
    | ~ ssList(app(sk7,cons(sk5,nil)))
    | ~ ssList(cons(sk6,nil)) ),
    inference(cn,[status(thm)],[inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_28,c_0_29]),c_0_22])]) ).

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

cnf(c_0_33,negated_conjecture,
    ( app(app(sk7,app(cons(sk5,nil),cons(sk6,nil))),sk8) = sk1
    | ~ ssList(cons(sk5,nil))
    | ~ ssList(cons(sk6,nil)) ),
    inference(cn,[status(thm)],[inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_16,c_0_17]),c_0_30])]) ).

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

cnf(c_0_35,negated_conjecture,
    ( sk9 = sk6
    | ~ ssList(cons(sk6,nil))
    | ~ ssList(cons(sk5,nil)) ),
    inference(cn,[status(thm)],[inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_31,c_0_32]),c_0_30])]) ).

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

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

cnf(c_0_38,negated_conjecture,
    ( app(app(sk7,cons(sk5,cons(sk6,nil))),sk8) = sk1
    | ~ ssList(cons(sk5,nil))
    | ~ ssList(cons(sk6,nil)) ),
    inference(cn,[status(thm)],[inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_33,c_0_21]),c_0_34])]) ).

cnf(c_0_39,negated_conjecture,
    ( sk9 = sk6
    | ~ ssList(cons(sk5,nil)) ),
    inference(cn,[status(thm)],[inference(rw,[status(thm)],[inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_35,c_0_36]),c_0_22]),c_0_37])]) ).

cnf(c_0_40,negated_conjecture,
    ( app(sk7,app(cons(sk5,cons(sk6,nil)),sk8)) = sk1
    | ~ ssList(cons(sk5,cons(sk6,nil)))
    | ~ ssList(cons(sk5,nil))
    | ~ ssList(cons(sk6,nil)) ),
    inference(cn,[status(thm)],[inference(rw,[status(thm)],[inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_17,c_0_38]),c_0_30]),c_0_18])]) ).

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

cnf(c_0_42,negated_conjecture,
    sk9 = sk6,
    inference(cn,[status(thm)],[inference(rw,[status(thm)],[inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_39,c_0_36]),c_0_34]),c_0_37])]) ).

cnf(c_0_43,negated_conjecture,
    ( app(sk7,cons(sk5,app(cons(sk6,nil),sk8))) = sk1
    | ~ ssList(cons(sk5,cons(sk6,nil)))
    | ~ ssList(cons(sk5,nil))
    | ~ ssList(cons(sk6,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_34]),c_0_18])]) ).

cnf(c_0_44,negated_conjecture,
    ( sk6 = X1
    | ~ memberP(sk1,X1)
    | ~ ssItem(X1) ),
    inference(rw,[status(thm)],[c_0_28,c_0_42]) ).

cnf(c_0_45,negated_conjecture,
    ( memberP(sk1,sk5)
    | ~ ssList(app(cons(sk6,nil),sk8))
    | ~ ssList(cons(sk5,cons(sk6,nil)))
    | ~ ssList(cons(sk5,nil))
    | ~ ssList(cons(sk6,nil)) ),
    inference(cn,[status(thm)],[inference(rw,[status(thm)],[inference(rw,[status(thm)],[inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_25,c_0_43]),c_0_34]),c_0_27]),c_0_30])]) ).

cnf(c_0_46,negated_conjecture,
    sk5 != sk6,
    co1_12 ).

cnf(c_0_47,negated_conjecture,
    ( ~ ssList(app(cons(sk6,nil),sk8))
    | ~ ssList(cons(sk5,cons(sk6,nil)))
    | ~ ssList(cons(sk5,nil))
    | ~ ssList(cons(sk6,nil)) ),
    inference(sr,[status(thm)],[inference(cn,[status(thm)],[inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_44,c_0_45]),c_0_34])]),c_0_46]) ).

cnf(c_0_48,negated_conjecture,
    ( ~ ssList(cons(sk5,cons(sk6,nil)))
    | ~ ssList(cons(sk5,nil))
    | ~ ssList(cons(sk6,nil)) ),
    inference(cn,[status(thm)],[inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_47,c_0_32]),c_0_18])]) ).

cnf(c_0_49,negated_conjecture,
    ( ~ ssList(cons(sk5,nil))
    | ~ ssList(cons(sk6,nil)) ),
    inference(cn,[status(thm)],[inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_48,c_0_36]),c_0_34])]) ).

cnf(c_0_50,negated_conjecture,
    ~ ssList(cons(sk5,nil)),
    inference(cn,[status(thm)],[inference(rw,[status(thm)],[inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_49,c_0_36]),c_0_22]),c_0_37])]) ).

cnf(c_0_51,negated_conjecture,
    $false,
    inference(cn,[status(thm)],[inference(rw,[status(thm)],[inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_50,c_0_36]),c_0_34]),c_0_37])]),
    [proof] ).

%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.06/0.19  % Problem    : SWC190-1 : TPTP v9.2.1. Released v2.4.0.
% 0.06/0.19  % Command    : /export/starexec/sandbox/solver/bin/lemma_parallel_prover %s --lemma-prover /export/starexec/sandbox/solver/bin/cse --final-prover /export/starexec/sandbox/solver/bin/eprover --proof-time %d --global-time-limit %d
% 0.12/0.42  % Computer : n011.cluster.edu
% 0.12/0.42  % Model    : x86_64 x86_64
% 0.12/0.42  % CPU      : Intel(R) Xeon(R) CPU E5-2620 v4 @ 2.10GHz
% 0.12/0.42  % Memory   : 8042.1875MB
% 0.12/0.42  % OS       : Linux 3.10.0-693.el7.x86_64
% 0.12/0.42  % CPULimit   : 300
% 0.12/0.42  % WCLimit    : 300
% 0.12/0.42  % DateTime   : Tue May  5 04:33:02 EDT 2026
% 0.12/0.43  % CPUTime    : 
% 0.14/0.46  % start to proof: theBenchmark
% 1.21/1.89  % Version  : CSE_E---1.7
% 1.21/1.89  % Problem  : theBenchmark.p
% 1.21/1.89  % SZS status Unsatisfiable for theBenchmark.p
% 1.21/1.89  % SZS output start CNFRefutation
% See solution above
% 1.21/1.89  % Total time : 1.383s
%------------------------------------------------------------------------------