↑ Up

CSE_E---1.7.UNS-CRf.s

View TPTP
Problem
Process solution in
SystemOnTSTP
Download .tgz
%------------------------------------------------------------------------------
% File     : CSE_E---1.7
% Problem  : SYN982-1 : TPTP v9.2.1. Released v3.1.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 : 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:51:11 PM UTC 2026

% Result   : Unsatisfiable 1.27s 1.71s
% Output   : CNFRefutation 1.27s
% Verified : 
% SZS Type : Refutation
%            Derivation depth      :    8
%            Number of leaves      :   16
% Syntax   : Number of clauses     :   48 (  16 unt;   0 nHn;  48 RR)
%            Number of literals    :  103 (   0 equ;  60 neg)
%            Maximal clause size   :    4 (   2 avg)
%            Maximal term depth    :    6 (   2 avg)
%            Number of predicates  :    8 (   7 usr;   1 prp; 0-1 aty)
%            Number of functors    :   12 (  12 usr;   5 con; 0-3 aty)
%            Number of variables   :   69 (  15 sgn)

% Comments : 
%------------------------------------------------------------------------------
cnf(clause30,axiom,
    ( ssSb(pair(X1,X2))
    | ~ ssM(sent(X1,b,pair(X1,X2)))
    | ~ ssBf(X2) ),
    file('/export/starexec/sandbox/benchmark/theBenchmark.p',clause30) ).

cnf(clause16,axiom,
    ssM(sent(a,b,pair(a,na))),
    file('/export/starexec/sandbox/benchmark/theBenchmark.p',clause16) ).

cnf(clause3,axiom,
    ssBf(na),
    file('/export/starexec/sandbox/benchmark/theBenchmark.p',clause3) ).

cnf(clause34,axiom,
    ( ssBk(key(X2,X1))
    | ~ ssM(sent(X1,b,pair(encr(triple(X1,X2,tb(X3)),bt),encr(nb(X3),X2))))
    | ~ ssSb(pair(X1,X3)) ),
    file('/export/starexec/sandbox/benchmark/theBenchmark.p',clause34) ).

cnf(clause27,axiom,
    ( ssM(sent(X2,X3,X1))
    | ~ ssIm(X1)
    | ~ ssP(X2)
    | ~ ssP(X3) ),
    file('/export/starexec/sandbox/benchmark/theBenchmark.p',clause27) ).

cnf(clause4,axiom,
    ssP(b),
    file('/export/starexec/sandbox/benchmark/theBenchmark.p',clause4) ).

cnf(clause5,axiom,
    ssP(a),
    file('/export/starexec/sandbox/benchmark/theBenchmark.p',clause5) ).

cnf(clause29,axiom,
    ( ssIm(encr(X1,X2))
    | ~ ssIm(X1)
    | ~ ssIk(key(X2,X3))
    | ~ ssP(X3) ),
    file('/export/starexec/sandbox/benchmark/theBenchmark.p',clause29) ).

cnf(clause25,axiom,
    ( ssIk(key(X1,X2))
    | ~ ssIm(X1)
    | ~ ssP(X2) ),
    file('/export/starexec/sandbox/benchmark/theBenchmark.p',clause25) ).

cnf(clause33,axiom,
    ( ssM(sent(b,t,triple(b,nb(X2),encr(triple(X1,X2,tb(X2)),bt))))
    | ~ ssM(sent(X1,b,pair(X1,X2)))
    | ~ ssBf(X2) ),
    file('/export/starexec/sandbox/benchmark/theBenchmark.p',clause33) ).

cnf(clause26,axiom,
    ( ssIm(pair(X1,X2))
    | ~ ssIm(X1)
    | ~ ssIm(X2) ),
    file('/export/starexec/sandbox/benchmark/theBenchmark.p',clause26) ).

cnf(clause37,negated_conjecture,
    ( ~ ssIk(key(X1,b))
    | ~ ssBk(key(X1,a)) ),
    file('/export/starexec/sandbox/benchmark/theBenchmark.p',clause37) ).

cnf(clause20,axiom,
    ( ssIm(X3)
    | ~ ssM(sent(X1,X2,X3)) ),
    file('/export/starexec/sandbox/benchmark/theBenchmark.p',clause20) ).

cnf(clause18,axiom,
    ( ssIm(X2)
    | ~ ssIm(triple(X1,X2,X3)) ),
    file('/export/starexec/sandbox/benchmark/theBenchmark.p',clause18) ).

cnf(clause17,axiom,
    ( ssIm(X3)
    | ~ ssIm(triple(X1,X2,X3)) ),
    file('/export/starexec/sandbox/benchmark/theBenchmark.p',clause17) ).

cnf(clause14,axiom,
    ( ssIm(X2)
    | ~ ssIm(pair(X1,X2)) ),
    file('/export/starexec/sandbox/benchmark/theBenchmark.p',clause14) ).

cnf(c_0_16,axiom,
    ( ssSb(pair(X1,X2))
    | ~ ssM(sent(X1,b,pair(X1,X2)))
    | ~ ssBf(X2) ),
    clause30 ).

cnf(c_0_17,axiom,
    ssM(sent(a,b,pair(a,na))),
    clause16 ).

cnf(c_0_18,axiom,
    ssBf(na),
    clause3 ).

cnf(c_0_19,axiom,
    ( ssBk(key(X2,X1))
    | ~ ssM(sent(X1,b,pair(encr(triple(X1,X2,tb(X3)),bt),encr(nb(X3),X2))))
    | ~ ssSb(pair(X1,X3)) ),
    clause34 ).

cnf(c_0_20,plain,
    ssSb(pair(a,na)),
    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,plain,
    ( ssBk(key(X1,a))
    | ~ ssM(sent(a,b,pair(encr(triple(a,X1,tb(na)),bt),encr(nb(na),X1)))) ),
    inference(spm,[status(thm)],[c_0_19,c_0_20]) ).

cnf(c_0_22,axiom,
    ( ssM(sent(X2,X3,X1))
    | ~ ssIm(X1)
    | ~ ssP(X2)
    | ~ ssP(X3) ),
    clause27 ).

cnf(c_0_23,axiom,
    ssP(b),
    clause4 ).

cnf(c_0_24,axiom,
    ssP(a),
    clause5 ).

cnf(c_0_25,axiom,
    ( ssIm(encr(X1,X2))
    | ~ ssIm(X1)
    | ~ ssIk(key(X2,X3))
    | ~ ssP(X3) ),
    clause29 ).

cnf(c_0_26,axiom,
    ( ssIk(key(X1,X2))
    | ~ ssIm(X1)
    | ~ ssP(X2) ),
    clause25 ).

cnf(c_0_27,axiom,
    ( ssM(sent(b,t,triple(b,nb(X2),encr(triple(X1,X2,tb(X2)),bt))))
    | ~ ssM(sent(X1,b,pair(X1,X2)))
    | ~ ssBf(X2) ),
    clause33 ).

cnf(c_0_28,plain,
    ( ssBk(key(X1,a))
    | ~ ssIm(pair(encr(triple(a,X1,tb(na)),bt),encr(nb(na),X1))) ),
    inference(cn,[status(thm)],[inference(rw,[status(thm)],[inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_21,c_0_22]),c_0_23]),c_0_24])]) ).

cnf(c_0_29,axiom,
    ( ssIm(pair(X1,X2))
    | ~ ssIm(X1)
    | ~ ssIm(X2) ),
    clause26 ).

cnf(c_0_30,plain,
    ( ssIm(encr(X1,X2))
    | ~ ssIm(X1)
    | ~ ssIm(X2)
    | ~ ssP(X3) ),
    inference(spm,[status(thm)],[c_0_25,c_0_26]) ).

cnf(c_0_31,negated_conjecture,
    ( ~ ssIk(key(X1,b))
    | ~ ssBk(key(X1,a)) ),
    clause37 ).

cnf(c_0_32,axiom,
    ( ssIm(X3)
    | ~ ssM(sent(X1,X2,X3)) ),
    clause20 ).

cnf(c_0_33,plain,
    ssM(sent(b,t,triple(b,nb(na),encr(triple(a,na,tb(na)),bt)))),
    inference(cn,[status(thm)],[inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_27,c_0_17]),c_0_18])]) ).

cnf(c_0_34,plain,
    ( ssBk(key(X1,a))
    | ~ ssIm(encr(triple(a,X1,tb(na)),bt))
    | ~ ssIm(encr(nb(na),X1)) ),
    inference(spm,[status(thm)],[c_0_28,c_0_29]) ).

cnf(c_0_35,plain,
    ( ssIm(encr(X1,X2))
    | ~ ssIm(X1)
    | ~ ssIm(X2) ),
    inference(spm,[status(thm)],[c_0_30,c_0_24]) ).

cnf(c_0_36,negated_conjecture,
    ( ~ ssIm(X1)
    | ~ ssBk(key(X1,a)) ),
    inference(cn,[status(thm)],[inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_31,c_0_26]),c_0_23])]) ).

cnf(c_0_37,axiom,
    ( ssIm(X2)
    | ~ ssIm(triple(X1,X2,X3)) ),
    clause18 ).

cnf(c_0_38,plain,
    ssIm(triple(b,nb(na),encr(triple(a,na,tb(na)),bt))),
    inference(spm,[status(thm)],[c_0_32,c_0_33]) ).

cnf(c_0_39,plain,
    ( ~ ssIm(encr(triple(a,X1,tb(na)),bt))
    | ~ ssIm(nb(na))
    | ~ ssIm(X1) ),
    inference(csr,[status(thm)],[inference(spm,[status(thm)],[c_0_34,c_0_35]),c_0_36]) ).

cnf(c_0_40,plain,
    ssIm(nb(na)),
    inference(spm,[status(thm)],[c_0_37,c_0_38]) ).

cnf(c_0_41,axiom,
    ( ssIm(X3)
    | ~ ssIm(triple(X1,X2,X3)) ),
    clause17 ).

cnf(c_0_42,axiom,
    ( ssIm(X2)
    | ~ ssIm(pair(X1,X2)) ),
    clause14 ).

cnf(c_0_43,plain,
    ssIm(pair(a,na)),
    inference(spm,[status(thm)],[c_0_32,c_0_17]) ).

cnf(c_0_44,plain,
    ( ~ ssIm(encr(triple(a,X1,tb(na)),bt))
    | ~ ssIm(X1) ),
    inference(cn,[status(thm)],[inference(rw,[status(thm)],[c_0_39,c_0_40])]) ).

cnf(c_0_45,plain,
    ssIm(encr(triple(a,na,tb(na)),bt)),
    inference(spm,[status(thm)],[c_0_41,c_0_38]) ).

cnf(c_0_46,plain,
    ssIm(na),
    inference(spm,[status(thm)],[c_0_42,c_0_43]) ).

cnf(c_0_47,plain,
    $false,
    inference(cn,[status(thm)],[inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_44,c_0_45]),c_0_46])]),
    [proof] ).

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