↑ Up

LisaST---0.9.THM-CRf.s

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

% Computer : n019.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:35 AM UTC 2026

% Result   : Theorem 11.87s 7.06s
% Output   : CNFRefutation 11.87s
% Verified : 
% SZS Type : Refutation
%            Derivation depth      :    7
%            Number of leaves      :   12
% Syntax   : Number of formulae    :   37 (  17 unt;   0 def)
%            Number of atoms       :   60 (   4 equ)
%            Maximal formula atoms :    3 (   1 avg)
%            Number of connectives :   41 (  18   ~;  15   |;   1   &)
%                                         (   0 <=>;   7  =>;   0  <=;   0 <~>)
%            Maximal formula depth :    5 (   2 avg)
%            Maximal term depth    :    3 (   1 avg)
%            Number of predicates  :    3 (   1 usr;   1 prp; 0-2 aty)
%            Number of functors    :   12 (  12 usr;   4 con; 0-2 aty)
%            Number of variables   :   30 (   2 sgn  12   !;   0   ?)

% Comments : 
%------------------------------------------------------------------------------
fof(ax45,axiom,
    ! [X0,X1] : 'constr$udec'('constr$uenc'(X1,X0),X0) = X1 ).

fof(ax46,axiom,
    ! [X0,X1] : 'constr$ucomm$udec'('constr$ucomm$uenc'(X1,X0),X0) = X1 ).

fof(ax50,axiom,
    ! [X0,X1] :
      ( ( 'pred$uattacker'(X1)
        & 'pred$uattacker'(X0) )
     => 'pred$uattacker'('constr$udec'(X0,X1)) ) ).

fof(ax56,axiom,
    'pred$uattacker'('constr$uCONST$u1') ).

fof(ax65,axiom,
    ! [X0] :
      ( 'pred$uattacker'('tuple$uA$uout$u4'(X0))
     => 'pred$uattacker'(X0) ) ).

fof(ax67,axiom,
    ! [X0] :
      ( 'pred$uattacker'('tuple$uA$uout$u3'(X0))
     => 'pred$uattacker'(X0) ) ).

fof(ax69,axiom,
    ! [X0] :
      ( 'pred$uattacker'('tuple$uA$uout$u1'(X0))
     => 'pred$uattacker'(X0) ) ).

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

fof(ax77,axiom,
    'pred$uattacker'('tuple$uA$uout$u1'('constr$ucomm$uenc'('name$um$u9','name$uKa'))) ).

fof(ax78,axiom,
    ! [X0] :
      ( 'pred$uattacker'('tuple$uA$uin$u2'(X0))
     => 'pred$uattacker'('tuple$uA$uout$u3'('constr$ucomm$udec'(X0,'name$uKa'))) ) ).

fof(ax79,axiom,
    ! [X0] :
      ( 'pred$uattacker'('tuple$uA$uin$u2'(X0))
     => 'pred$uattacker'('tuple$uA$uout$u4'('constr$uenc'('name$uobjective','name$um$u9'))) ) ).

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

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

cnf(c45,plain,
    'constr$udec'('constr$uenc'(X0,X1),X1) = X0,
    inference(clausification,[status(esa)],[ax45]) ).

cnf(c46,plain,
    'constr$ucomm$udec'('constr$ucomm$uenc'(X0,X1),X1) = X0,
    inference(clausification,[status(esa)],[ax46]) ).

cnf(c50,plain,
    ( 'pred$uattacker'('constr$udec'(X0,X1))
    | ~ 'pred$uattacker'(X1)
    | ~ 'pred$uattacker'(X0) ),
    inference(clausification,[status(esa)],[ax50]) ).

cnf(c56,plain,
    'pred$uattacker'('constr$uCONST$u1'),
    inference(clausification,[status(esa)],[ax56]) ).

cnf(c65,plain,
    ( 'pred$uattacker'(X0)
    | ~ 'pred$uattacker'('tuple$uA$uout$u4'(X0)) ),
    inference(clausification,[status(esa)],[ax65]) ).

cnf(c67,plain,
    ( 'pred$uattacker'(X0)
    | ~ 'pred$uattacker'('tuple$uA$uout$u3'(X0)) ),
    inference(clausification,[status(esa)],[ax67]) ).

cnf(c69,plain,
    ( 'pred$uattacker'(X0)
    | ~ 'pred$uattacker'('tuple$uA$uout$u1'(X0)) ),
    inference(clausification,[status(esa)],[ax69]) ).

cnf(c70,plain,
    ( 'pred$uattacker'('tuple$uA$uin$u2'(X0))
    | ~ 'pred$uattacker'(X0) ),
    inference(clausification,[status(esa)],[ax70]) ).

cnf(c77,plain,
    'pred$uattacker'('tuple$uA$uout$u1'('constr$ucomm$uenc'('name$um$u9','name$uKa'))),
    inference(clausification,[status(esa)],[ax77]) ).

cnf(c78,plain,
    ( 'pred$uattacker'('tuple$uA$uout$u3'('constr$ucomm$udec'(X0,'name$uKa')))
    | ~ 'pred$uattacker'('tuple$uA$uin$u2'(X0)) ),
    inference(clausification,[status(esa)],[ax78]) ).

cnf(c79,plain,
    ( 'pred$uattacker'('tuple$uA$uout$u4'('constr$uenc'('name$uobjective','name$um$u9')))
    | ~ 'pred$uattacker'('tuple$uA$uin$u2'(X0)) ),
    inference(clausification,[status(esa)],[ax79]) ).

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

cnf(d0,plain,
    'pred$uattacker'('constr$ucomm$uenc'('name$um$u9','name$uKa')),
    inference(resolution,[status(thm)],[c69,c77]) ).

cnf(d1,plain,
    ( 'pred$uattacker'('constr$ucomm$udec'(X0,'name$uKa'))
    | ~ 'pred$uattacker'('tuple$uA$uin$u2'(X0)) ),
    inference(resolution,[status(thm)],[c78,c67]) ).

cnf(d2,plain,
    ( ~ 'pred$uattacker'('tuple$uA$uin$u2'('constr$ucomm$uenc'(X0,'name$uKa')))
    | 'pred$uattacker'(X0) ),
    inference(superposition,[status(thm)],[c46,d1]) ).

cnf(d3,plain,
    ( ~ 'pred$uattacker'('constr$ucomm$uenc'(X0,'name$uKa'))
    | 'pred$uattacker'(X0) ),
    inference(resolution,[status(thm)],[d2,c70]) ).

cnf(d4,plain,
    'pred$uattacker'('name$um$u9'),
    inference(resolution,[status(thm)],[d3,d0]) ).

cnf(d5,plain,
    ( ~ 'pred$uattacker'(X1)
    | ~ 'pred$uattacker'('constr$uenc'(X0,X1))
    | 'pred$uattacker'(X0) ),
    inference(superposition,[status(thm)],[c45,c50]) ).

cnf(d6,plain,
    ( ~ 'pred$uattacker'(X0)
    | 'pred$uattacker'('tuple$uA$uout$u4'('constr$uenc'('name$uobjective','name$um$u9'))) ),
    inference(resolution,[status(thm)],[c79,c70]) ).

cnf(d7,plain,
    'pred$uattacker'('tuple$uA$uout$u4'('constr$uenc'('name$uobjective','name$um$u9'))),
    inference(resolution,[status(thm)],[d6,c56]) ).

cnf(d8,plain,
    'pred$uattacker'('constr$uenc'('name$uobjective','name$um$u9')),
    inference(resolution,[status(thm)],[d7,c65]) ).

cnf(d9,plain,
    ( 'pred$uattacker'('name$uobjective')
    | ~ 'pred$uattacker'('name$um$u9') ),
    inference(resolution,[status(thm)],[d8,d5]) ).

cnf(d10,plain,
    ~ 'pred$uattacker'('name$um$u9'),
    inference(resolution,[status(thm)],[c81,d9]) ).

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

%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.00/0.02  % Problem  : SWW955+1 : TPTP v9.3.1. Released v7.4.0.
% 0.00/0.03  % Command  : casc-portfolio.sh -t 300 /export/starexec/sandbox/benchmark/theBenchmark.p
% 0.10/5.38  % Computer : n019.cluster.edu
% 0.10/5.38  % Model    : x86_64 x86_64
% 0.10/5.38  % CPU      : Intel(R) Xeon(R) CPU E5-2620 v4 @ 2.10GHz
% 0.10/5.38  % Memory   : 8046.5625MB
% 0.10/5.38  % OS       : Linux 6.8.0-71-generic
% 0.10/5.38  % CPULimit : 300
% 0.10/5.38  % WCLimit  : 300
% 0.10/5.39  % DateTime : Sat Sep 26 16:37:56 UTC 2026
% 0.10/5.39  % CPUTime  : 
% 0.10/5.39  Running casc-portfolio.sh -t 300 /export/starexec/sandbox/benchmark/theBenchmark.p
% 11.87/7.06  % SZS status Theorem for theBenchmark.p
% 11.87/7.06  % SZS output start CNFRefutation for theBenchmark.p
% See solution above
%------------------------------------------------------------------------------