↑ Up

LisaST---0.9.THM-CRf.s

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

% Computer : n017.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:12:36 AM UTC 2026

% Result   : Theorem 6.48s 2.75s
% Output   : CNFRefutation 6.48s
% Verified : 
% SZS Type : Refutation
%            Derivation depth      :   12
%            Number of leaves      :    8
% Syntax   : Number of formulae    :   28 (  10 unt;   0 def)
%            Number of atoms       :   72 (   0 equ)
%            Maximal formula atoms :    7 (   2 avg)
%            Number of connectives :   80 (  36   ~;  34   |;   5   &)
%                                         (   0 <=>;   5  =>;   0  <=;   0 <~>)
%            Maximal formula depth :   11 (   3 avg)
%            Maximal term depth    :    4 (   1 avg)
%            Number of predicates  :    3 (   2 usr;   1 prp; 0-2 aty)
%            Number of functors    :   17 (  17 usr;   5 con; 0-2 aty)
%            Number of variables   :   43 (  23 sgn  10   !;   0   ?)

% Comments : 
%------------------------------------------------------------------------------
fof(ax95,axiom,
    ! [X0,X1] : 'pred$ueq$ubitstring$ubitstring'(X0,X1) ).

fof(ax133,axiom,
    ! [X0] :
      ( 'pred$uattacker'('tuple$uclient$uB$uout$u6'(X0))
     => 'pred$uattacker'(X0) ) ).

fof(ax139,axiom,
    ! [X0] :
      ( 'pred$uattacker'(X0)
     => 'pred$uattacker'('tuple$uclient$uB$uin$u5'(X0)) ) ).

fof(ax141,axiom,
    ! [X0] :
      ( 'pred$uattacker'(X0)
     => 'pred$uattacker'('tuple$uclient$uB$uin$u3'(X0)) ) ).

fof(ax143,axiom,
    ! [X0] :
      ( 'pred$uattacker'(X0)
     => 'pred$uattacker'('tuple$uclient$uB$uin$u2'(X0)) ) ).

fof(ax190,axiom,
    'pred$uattacker'('tuple$uclient$uB$uout$u1'('name$uB','name$uA')) ).

fof(ax192,axiom,
    ! [X0,X1,X2,X3] :
      ( ( 'pred$uattacker'('tuple$uclient$uB$uin$u2'(X3))
        & 'pred$ueq$ubitstring$ubitstring'('name$uA','constr$utuple$u2$uget$u0x30'('constr$uchecksign'(X3,'constr$upkey'('name$uskS'))))
        & 'pred$uattacker'('tuple$uclient$uB$uin$u3'(X1))
        & 'pred$ueq$ubitstring$ubitstring'('name$uA','constr$utuple$u2$uget$u1'('constr$uecb$udec$u2'(X1,'name$uskB')))
        & 'pred$uattacker'('tuple$uclient$uB$uin$u5'(X2))
        & 'pred$ueq$ubitstring$ubitstring'('name$uNb'(X0),'constr$uecb$udec$u1'(X2,'name$uskB')) )
     => 'pred$uattacker'('tuple$uclient$uB$uout$u6'('name$uobjective')) ) ).

fof(co0,conjecture,
    'pred$uattacker'('name$uobjective') ).

fof(negated_conjecture,negated_conjecture,
    ~ 'pred$uattacker'('name$uobjective'),
    inference(negate_conjecture,[status(cth)],[co0]) ).

cnf(c95,plain,
    'pred$ueq$ubitstring$ubitstring'(X0,X1),
    inference(clausification,[status(esa)],[ax95]) ).

cnf(c133,plain,
    ( 'pred$uattacker'(X0)
    | ~ 'pred$uattacker'('tuple$uclient$uB$uout$u6'(X0)) ),
    inference(clausification,[status(esa)],[ax133]) ).

cnf(c139,plain,
    ( 'pred$uattacker'('tuple$uclient$uB$uin$u5'(X0))
    | ~ 'pred$uattacker'(X0) ),
    inference(clausification,[status(esa)],[ax139]) ).

cnf(c141,plain,
    ( 'pred$uattacker'('tuple$uclient$uB$uin$u3'(X0))
    | ~ 'pred$uattacker'(X0) ),
    inference(clausification,[status(esa)],[ax141]) ).

cnf(c143,plain,
    ( 'pred$uattacker'('tuple$uclient$uB$uin$u2'(X0))
    | ~ 'pred$uattacker'(X0) ),
    inference(clausification,[status(esa)],[ax143]) ).

cnf(c190,plain,
    'pred$uattacker'('tuple$uclient$uB$uout$u1'('name$uB','name$uA')),
    inference(clausification,[status(esa)],[ax190]) ).

cnf(c192,plain,
    ( ~ 'pred$ueq$ubitstring$ubitstring'('name$uA','constr$utuple$u2$uget$u1'('constr$uecb$udec$u2'(X3,'name$uskB')))
    | ~ 'pred$ueq$ubitstring$ubitstring'('name$uA','constr$utuple$u2$uget$u0x30'('constr$uchecksign'(X2,'constr$upkey'('name$uskS'))))
    | ~ 'pred$uattacker'('tuple$uclient$uB$uin$u3'(X3))
    | ~ 'pred$uattacker'('tuple$uclient$uB$uin$u5'(X1))
    | ~ 'pred$uattacker'('tuple$uclient$uB$uin$u2'(X2))
    | ~ 'pred$ueq$ubitstring$ubitstring'('name$uNb'(X0),'constr$uecb$udec$u1'(X1,'name$uskB'))
    | 'pred$uattacker'('tuple$uclient$uB$uout$u6'('name$uobjective')) ),
    inference(clausification,[status(esa)],[ax192]) ).

cnf(c195,plain,
    ~ 'pred$uattacker'('name$uobjective'),
    inference(clausification,[status(esa)],[negated_conjecture]) ).

cnf(d0,plain,
    ( ~ 'pred$uattacker'('tuple$uclient$uB$uin$u2'(X0))
    | ~ 'pred$uattacker'('tuple$uclient$uB$uin$u3'(X3))
    | ~ 'pred$uattacker'('tuple$uclient$uB$uin$u5'(X2))
    | 'pred$uattacker'('tuple$uclient$uB$uout$u6'('name$uobjective'))
    | ~ 'pred$ueq$ubitstring$ubitstring'('name$uNb'(X1),'constr$uecb$udec$u1'(X2,'name$uskB'))
    | ~ 'pred$ueq$ubitstring$ubitstring'('name$uA','constr$utuple$u2$uget$u0x30'('constr$uchecksign'(X0,'constr$upkey'('name$uskS')))) ),
    inference(resolution,[status(thm)],[c95,c192]) ).

cnf(d1,plain,
    ( ~ 'pred$uattacker'('tuple$uclient$uB$uin$u2'(X3))
    | ~ 'pred$uattacker'('tuple$uclient$uB$uin$u3'(X2))
    | ~ 'pred$uattacker'('tuple$uclient$uB$uin$u5'(X1))
    | 'pred$uattacker'('tuple$uclient$uB$uout$u6'('name$uobjective'))
    | ~ 'pred$ueq$ubitstring$ubitstring'('name$uNb'(X0),'constr$uecb$udec$u1'(X1,'name$uskB')) ),
    inference(resolution,[status(thm)],[d0,c95]) ).

cnf(d2,plain,
    ( ~ 'pred$uattacker'('tuple$uclient$uB$uin$u2'(X2))
    | ~ 'pred$uattacker'('tuple$uclient$uB$uin$u3'(X1))
    | ~ 'pred$uattacker'('tuple$uclient$uB$uin$u5'(X0))
    | 'pred$uattacker'('tuple$uclient$uB$uout$u6'('name$uobjective')) ),
    inference(resolution,[status(thm)],[c95,d1]) ).

cnf(d3,plain,
    ( ~ 'pred$uattacker'(X2)
    | ~ 'pred$uattacker'('tuple$uclient$uB$uin$u3'(X1))
    | ~ 'pred$uattacker'('tuple$uclient$uB$uin$u5'(X0))
    | 'pred$uattacker'('tuple$uclient$uB$uout$u6'('name$uobjective')) ),
    inference(resolution,[status(thm)],[d2,c143]) ).

cnf(d4,plain,
    ( ~ 'pred$uattacker'(X2)
    | ~ 'pred$uattacker'('tuple$uclient$uB$uin$u5'(X1))
    | 'pred$uattacker'('tuple$uclient$uB$uout$u6'('name$uobjective'))
    | ~ 'pred$uattacker'(X0) ),
    inference(resolution,[status(thm)],[d3,c141]) ).

cnf(d5,plain,
    ( ~ 'pred$uattacker'(X2)
    | 'pred$uattacker'('tuple$uclient$uB$uout$u6'('name$uobjective'))
    | ~ 'pred$uattacker'(X1)
    | ~ 'pred$uattacker'(X0) ),
    inference(resolution,[status(thm)],[d4,c139]) ).

cnf(d6,plain,
    ( 'pred$uattacker'('tuple$uclient$uB$uout$u6'('name$uobjective'))
    | ~ 'pred$uattacker'(X1)
    | ~ 'pred$uattacker'(X0) ),
    inference(resolution,[status(thm)],[d5,c190]) ).

cnf(d7,plain,
    ( 'pred$uattacker'('tuple$uclient$uB$uout$u6'('name$uobjective'))
    | ~ 'pred$uattacker'(X0) ),
    inference(resolution,[status(thm)],[d6,c190]) ).

cnf(d8,plain,
    'pred$uattacker'('tuple$uclient$uB$uout$u6'('name$uobjective')),
    inference(resolution,[status(thm)],[d7,c190]) ).

cnf(d9,plain,
    'pred$uattacker'('name$uobjective'),
    inference(resolution,[status(thm)],[d8,c133]) ).

cnf(d10,plain,
    $false,
    inference(resolution,[status(thm)],[c195,d9]) ).

%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.00/0.03  % Problem  : SWW963+1 : TPTP v9.3.1. Released v7.4.0.
% 0.00/0.04  % Command  : casc-portfolio.sh -t 300 /export/starexec/sandbox2/benchmark/theBenchmark.p
% 0.09/0.36  % Computer : n017.cluster.edu
% 0.09/0.36  % Model    : x86_64 x86_64
% 0.09/0.36  % CPU      : Intel(R) Xeon(R) CPU E5-2620 v4 @ 2.10GHz
% 0.09/0.36  % Memory   : 8046.5625MB
% 0.09/0.36  % OS       : Linux 6.8.0-71-generic
% 0.09/0.36  % CPULimit : 300
% 0.09/0.36  % WCLimit  : 300
% 0.09/0.36  % DateTime : Sat Sep 26 16:34:20 UTC 2026
% 0.09/0.36  % CPUTime  : 
% 0.09/0.36  Running casc-portfolio.sh -t 300 /export/starexec/sandbox2/benchmark/theBenchmark.p
% 6.48/2.75  % SZS status Theorem for theBenchmark.p
% 6.48/2.75  % SZS output start CNFRefutation for theBenchmark.p
% See solution above
%------------------------------------------------------------------------------