↑ Up

CSE_E---1.7.UNS-CRf.s

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

% Result   : Unsatisfiable 1.35s 1.74s
% Output   : CNFRefutation 1.35s
% Verified : 
% SZS Type : Refutation
%            Derivation depth      :    6
%            Number of leaves      :   13
% Syntax   : Number of clauses     :   37 (  17 unt;   6 nHn;  33 RR)
%            Number of literals    :   72 (  26 equ;  36 neg)
%            Maximal clause size   :    5 (   1 avg)
%            Maximal term depth    :    3 (   1 avg)
%            Number of predicates  :    5 (   3 usr;   1 prp; 0-2 aty)
%            Number of functors    :    8 (   8 usr;   5 con; 0-2 aty)
%            Number of variables   :   23 (   4 sgn)

% Comments : 
%------------------------------------------------------------------------------
cnf(co1_10,negated_conjecture,
    ( nil = sk2
    | nil = sk1 ),
    file('/export/starexec/sandbox/benchmark/theBenchmark.p',co1_10) ).

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

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

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

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

cnf(clause71,axiom,
    ( ~ memberP(nil,X1)
    | ~ ssItem(X1) ),
    file('/export/starexec/sandbox/benchmark/Axioms/SWC001-0.ax',clause71) ).

cnf(clause109,axiom,
    ( cons(skaf83(X1),skaf82(X1)) = X1
    | nil = X1
    | ~ ssList(X1) ),
    file('/export/starexec/sandbox/benchmark/Axioms/SWC001-0.ax',clause109) ).

cnf(clause12,axiom,
    ssItem(skaf83(X1)),
    file('/export/starexec/sandbox/benchmark/Axioms/SWC001-0.ax',clause12) ).

cnf(clause13,axiom,
    ssList(skaf82(X1)),
    file('/export/starexec/sandbox/benchmark/Axioms/SWC001-0.ax',clause13) ).

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

cnf(co1_13,negated_conjecture,
    ( nil != sk1
    | nil != sk2 ),
    file('/export/starexec/sandbox/benchmark/theBenchmark.p',co1_13) ).

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

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

cnf(c_0_13,negated_conjecture,
    ( nil = sk2
    | nil = sk1 ),
    co1_10 ).

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

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

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

cnf(c_0_17,negated_conjecture,
    ( memberP(sk4,X1)
    | ~ ssItem(X1)
    | ~ memberP(sk3,X1) ),
    co1_8 ).

cnf(c_0_18,negated_conjecture,
    ( sk4 = nil
    | sk3 = nil ),
    inference(rw,[status(thm)],[inference(rw,[status(thm)],[c_0_13,c_0_14]),c_0_15]) ).

cnf(c_0_19,axiom,
    ( ~ memberP(nil,X1)
    | ~ ssItem(X1) ),
    clause71 ).

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

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

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

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

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

cnf(c_0_25,negated_conjecture,
    ( sk3 = nil
    | ~ memberP(sk3,X1)
    | ~ ssItem(X1) ),
    inference(csr,[status(thm)],[inference(spm,[status(thm)],[c_0_17,c_0_18]),c_0_19]) ).

cnf(c_0_26,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_20,c_0_21]),c_0_22]),c_0_23])]) ).

cnf(c_0_27,negated_conjecture,
    ssList(sk3),
    inference(rw,[status(thm)],[c_0_24,c_0_14]) ).

cnf(c_0_28,negated_conjecture,
    ( nil != sk1
    | nil != sk2 ),
    co1_13 ).

cnf(c_0_29,negated_conjecture,
    ( memberP(sk3,X1)
    | ~ ssItem(X1)
    | ~ memberP(sk4,X1) ),
    co1_9 ).

cnf(c_0_30,negated_conjecture,
    sk3 = nil,
    inference(cn,[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])]) ).

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

cnf(c_0_32,negated_conjecture,
    ( sk3 != nil
    | sk4 != nil ),
    inference(rw,[status(thm)],[inference(rw,[status(thm)],[c_0_28,c_0_14]),c_0_15]) ).

cnf(c_0_33,negated_conjecture,
    ( ~ memberP(sk4,X1)
    | ~ ssItem(X1) ),
    inference(csr,[status(thm)],[inference(rw,[status(thm)],[c_0_29,c_0_30]),c_0_19]) ).

cnf(c_0_34,negated_conjecture,
    ssList(sk4),
    inference(rw,[status(thm)],[c_0_31,c_0_15]) ).

cnf(c_0_35,negated_conjecture,
    sk4 != nil,
    inference(cn,[status(thm)],[inference(rw,[status(thm)],[c_0_32,c_0_30])]) ).

cnf(c_0_36,negated_conjecture,
    $false,
    inference(sr,[status(thm)],[inference(cn,[status(thm)],[inference(rw,[status(thm)],[inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_33,c_0_26]),c_0_22]),c_0_34])]),c_0_35]),
    [proof] ).

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