↑ Up

LisaST---0.9.THM-CRf.s

View TPTP
Problem
Process solution in
SystemOnTSTP
Download .tgz
%------------------------------------------------------------------------------
% File     : LisaST---0.9
% Problem  : SWV237+1 : TPTP v9.3.1. Released v3.2.0.
% Transfm  : none
% Format   : tptp:raw
% Command  : casc-portfolio.sh -t 300 /export/starexec/sandbox2/benchmark/theBenchmark.p

% Computer : n014.cluster.edu
% Model    : x86_64 x86_64
% CPU      : Intel(R) Xeon(R) CPU E5-2620 v4 2.10GHz
% Memory   : 8046.5625MB
% OS       : Linux 6.8.0-71-generic
% CPULimit : 300s
% WCLimit  : 300s
% DateTime : Sun Sep 27 09:01:43 AM UTC 2026

% Result   : Theorem 20.40s 5.71s
% Output   : CNFRefutation 20.40s
% Verified : 
% SZS Type : Refutation
%            Derivation depth      :   13
%            Number of leaves      :    9
% Syntax   : Number of formulae    :   31 (  20 unt;   0 def)
%            Number of atoms       :   64 (   7 equ)
%            Maximal formula atoms :    6 (   2 avg)
%            Number of connectives :   66 (  33   ~;  27   |;   4   &)
%                                         (   0 <=>;   2  =>;   0  <=;   0 <~>)
%            Maximal formula depth :    7 (   3 avg)
%            Maximal term depth    :    4 (   1 avg)
%            Number of predicates  :    3 (   1 usr;   1 prp; 0-2 aty)
%            Number of functors    :    7 (   7 usr;   5 con; 0-2 aty)
%            Number of variables   :   48 (  20 sgn   9   !;   0   ?)

% Comments : 
%------------------------------------------------------------------------------
fof(enc_dec_cancel,axiom,
    ! [X0,X1] : enc(i(X0),enc(X0,X1)) = X1 ).

fof(double_inverse_cancel,axiom,
    ! [X0] : i(i(X0)) = X0 ).

fof(encrypt_a_stored_comms_key,axiom,
    ! [X0,X1,X2] :
      ( ( p(X2)
        & p(X1)
        & p(X0) )
     => p(enc(enc(i(tmk),X1),enc(i(tc),X0))) ) ).

fof(encrypt_clear_key_as_Tcomms_key,axiom,
    ! [X0,X1,X2] :
      ( ( p(X2)
        & p(X1)
        & p(X0) )
     => p(enc(tc,X0)) ) ).

fof(intruder_knows_1,axiom,
    p(enc(tmk,pp)) ).

fof(intruder_knows_6,axiom,
    p(kk) ).

fof(intruder_knows_7,axiom,
    p(i(kk)) ).

fof(intruder_knows_8,axiom,
    p(a) ).

fof(co1,conjecture,
    p(enc(pp,a)) ).

fof(negated_conjecture,negated_conjecture,
    ~ p(enc(pp,a)),
    inference(negate_conjecture,[status(cth)],[co1]) ).

cnf(c0,plain,
    enc(i(X0),enc(X0,X1)) = X1,
    inference(clausification,[status(esa)],[enc_dec_cancel]) ).

cnf(c2,plain,
    i(i(X0)) = X0,
    inference(clausification,[status(esa)],[double_inverse_cancel]) ).

cnf(c8,plain,
    ( p(enc(enc(i(tmk),X1),enc(i(tc),X0)))
    | ~ p(X2)
    | ~ p(X1)
    | ~ p(X0) ),
    inference(clausification,[status(esa)],[encrypt_a_stored_comms_key]) ).

cnf(c9,plain,
    ( p(enc(tc,X0))
    | ~ p(X2)
    | ~ p(X1)
    | ~ p(X0) ),
    inference(clausification,[status(esa)],[encrypt_clear_key_as_Tcomms_key]) ).

cnf(c16,plain,
    p(enc(tmk,pp)),
    inference(clausification,[status(esa)],[intruder_knows_1]) ).

cnf(c21,plain,
    p(kk),
    inference(clausification,[status(esa)],[intruder_knows_6]) ).

cnf(c22,plain,
    p(i(kk)),
    inference(clausification,[status(esa)],[intruder_knows_7]) ).

cnf(c23,plain,
    p(a),
    inference(clausification,[status(esa)],[intruder_knows_8]) ).

cnf(c24,plain,
    ~ p(enc(pp,a)),
    inference(clausification,[status(esa)],[negated_conjecture]) ).

cnf(d0,plain,
    enc(i(i(X0)),X1) = enc(X0,X1),
    inference(superposition,[status(thm)],[c0,c0]) ).

cnf(d1,plain,
    enc(X0,X1) = enc(X0,X1),
    inference(demodulation,[status(thm)],[d0,c2]) ).

cnf(d2,plain,
    X1 = enc(i(X0),enc(X0,X1)),
    inference(superposition,[status(thm)],[c0,d1]) ).

cnf(d3,plain,
    ( ~ p(X1)
    | ~ p(X2)
    | ~ p(enc(tmk,X0))
    | p(enc(X0,enc(i(tc),X1))) ),
    inference(superposition,[status(thm)],[d2,c8]) ).

cnf(d4,plain,
    ( ~ p(enc(tmk,X1))
    | ~ p(enc(tc,X0))
    | ~ p(X2)
    | p(enc(X1,X0)) ),
    inference(superposition,[status(thm)],[d2,d3]) ).

cnf(d5,plain,
    ( ~ p(X2)
    | ~ p(X4)
    | ~ p(X3)
    | ~ p(enc(tmk,X1))
    | p(enc(X1,X2))
    | ~ p(X0) ),
    inference(resolution,[status(thm)],[d4,c9]) ).

cnf(d6,plain,
    ( p(enc(pp,X2))
    | ~ p(X3)
    | ~ p(X2)
    | ~ p(X1)
    | ~ p(X0) ),
    inference(resolution,[status(thm)],[d5,c16]) ).

cnf(d7,plain,
    ( ~ p(X2)
    | ~ p(X1)
    | ~ p(a)
    | ~ p(X0) ),
    inference(resolution,[status(thm)],[d6,c24]) ).

cnf(d8,plain,
    ( ~ p(X2)
    | ~ p(X1)
    | ~ p(X0) ),
    inference(resolution,[status(thm)],[c23,d7]) ).

cnf(d9,plain,
    ( ~ p(X1)
    | ~ p(X0) ),
    inference(resolution,[status(thm)],[d8,c22]) ).

cnf(d10,plain,
    ~ p(X0),
    inference(resolution,[status(thm)],[d9,c22]) ).

cnf(d11,plain,
    $false,
    inference(resolution,[status(thm)],[d10,c21]) ).

%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.00/0.05  % Problem  : SWV237+1 : TPTP v9.3.1. Released v3.2.0.
% 0.00/0.06  % Command  : casc-portfolio.sh -t 300 /export/starexec/sandbox2/benchmark/theBenchmark.p
% 0.18/0.44  % Computer : n014.cluster.edu
% 0.18/0.44  % Model    : x86_64 x86_64
% 0.18/0.44  % CPU      : Intel(R) Xeon(R) CPU E5-2620 v4 @ 2.10GHz
% 0.18/0.44  % Memory   : 8046.5625MB
% 0.18/0.44  % OS       : Linux 6.8.0-71-generic
% 0.18/0.44  % CPULimit : 300
% 0.18/0.44  % WCLimit  : 300
% 0.18/0.44  % DateTime : Sat Sep 26 13:21:02 UTC 2026
% 0.18/0.45  % CPUTime  : 
% 0.18/0.45  Running casc-portfolio.sh -t 300 /export/starexec/sandbox2/benchmark/theBenchmark.p
% 20.40/5.71  % SZS status Theorem for theBenchmark.p
% 20.40/5.71  % SZS output start CNFRefutation for theBenchmark.p
% See solution above
%------------------------------------------------------------------------------