↑ Up

CSE_E---1.7.UNS-CRf.s

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

% Result   : Unsatisfiable 1.32s 1.73s
% Output   : CNFRefutation 1.32s
% Verified : 
% SZS Type : Refutation
%            Derivation depth      :    7
%            Number of leaves      :   12
% Syntax   : Number of clauses     :   33 (  14 unt;   2 nHn;  31 RR)
%            Number of literals    :   68 (  15 equ;  37 neg)
%            Maximal clause size   :    6 (   2 avg)
%            Maximal term depth    :    3 (   1 avg)
%            Number of predicates  :    6 (   4 usr;   1 prp; 0-2 aty)
%            Number of functors    :    7 (   7 usr;   3 con; 0-2 aty)
%            Number of variables   :   27 (   2 sgn)

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

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

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

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

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

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

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

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

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

cnf(co1_10,negated_conjecture,
    ( ~ ssItem(X1)
    | X1 != sk5(X1) ),
    file('/export/starexec/sandbox/benchmark/theBenchmark.p',co1_10) ).

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

cnf(c_0_13,axiom,
    ( cons(skaf44(X1),nil) = X1
    | ~ singletonP(X1)
    | ~ ssList(X1) ),
    clause101 ).

cnf(c_0_14,axiom,
    ssItem(skaf44(X1)),
    clause47 ).

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

cnf(c_0_16,plain,
    ( skaf44(X1) = hd(X1)
    | ~ singletonP(X1)
    | ~ ssList(X1) ),
    inference(cn,[status(thm)],[inference(rw,[status(thm)],[inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_12,c_0_13]),c_0_14]),c_0_15])]) ).

cnf(c_0_17,negated_conjecture,
    singletonP(sk3),
    co1_7 ).

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

cnf(c_0_19,plain,
    ( cons(hd(X1),nil) = X1
    | ~ singletonP(X1)
    | ~ ssList(X1) ),
    inference(spm,[status(thm)],[c_0_13,c_0_16]) ).

cnf(c_0_20,negated_conjecture,
    singletonP(sk1),
    inference(rw,[status(thm)],[c_0_17,c_0_18]) ).

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

cnf(c_0_22,plain,
    ( ssItem(hd(X1))
    | ~ singletonP(X1)
    | ~ ssList(X1) ),
    inference(spm,[status(thm)],[c_0_14,c_0_16]) ).

cnf(c_0_23,axiom,
    ( memberP(X2,X3)
    | X3 = X1
    | ~ memberP(cons(X1,X2),X3)
    | ~ ssList(X2)
    | ~ ssItem(X1)
    | ~ ssItem(X3) ),
    clause161 ).

cnf(c_0_24,negated_conjecture,
    cons(hd(sk1),nil) = sk1,
    inference(cn,[status(thm)],[inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_19,c_0_20]),c_0_21])]) ).

cnf(c_0_25,negated_conjecture,
    ssItem(hd(sk1)),
    inference(cn,[status(thm)],[inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_22,c_0_20]),c_0_21])]) ).

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

cnf(c_0_27,negated_conjecture,
    ( hd(sk1) = X1
    | ~ memberP(sk1,X1)
    | ~ ssItem(X1) ),
    inference(csr,[status(thm)],[inference(cn,[status(thm)],[inference(rw,[status(thm)],[inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_23,c_0_24]),c_0_25]),c_0_15])]),c_0_26]) ).

cnf(c_0_28,negated_conjecture,
    ( memberP(sk1,sk5(X1))
    | ~ ssItem(X1) ),
    co1_9 ).

cnf(c_0_29,negated_conjecture,
    ( ssItem(sk5(X1))
    | ~ ssItem(X1) ),
    co1_8 ).

cnf(c_0_30,negated_conjecture,
    ( ~ ssItem(X1)
    | X1 != sk5(X1) ),
    co1_10 ).

cnf(c_0_31,negated_conjecture,
    ( sk5(X1) = hd(sk1)
    | ~ ssItem(X1) ),
    inference(csr,[status(thm)],[inference(spm,[status(thm)],[c_0_27,c_0_28]),c_0_29]) ).

cnf(c_0_32,negated_conjecture,
    $false,
    inference(cn,[status(thm)],[inference(rw,[status(thm)],[inference(er,[status(thm)],[inference(spm,[status(thm)],[c_0_30,c_0_31])]),c_0_25])]),
    [proof] ).

%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.00/0.12  % Problem    : SWC200-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.16/0.33  % Computer : n008.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:32:58 EDT 2026
% 0.16/0.33  % CPUTime    : 
% 0.16/0.34  % start to proof: theBenchmark
% 1.32/1.73  % Version  : CSE_E---1.7
% 1.32/1.73  % Problem  : theBenchmark.p
% 1.32/1.73  % SZS status Unsatisfiable for theBenchmark.p
% 1.32/1.73  % SZS output start CNFRefutation
% See solution above
% 1.32/1.73  % Total time : 1.373s
%------------------------------------------------------------------------------