↑ Up

LisaST---0.9.THM-CRf.s

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

% Computer : n006.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:33 AM UTC 2026

% Result   : Theorem 34.82s 8.76s
% Output   : CNFRefutation 34.82s
% Verified : 
% SZS Type : Refutation
%            Derivation depth      :   10
%            Number of leaves      :    3
% Syntax   : Number of formulae    :   20 (  10 unt;   0 def)
%            Number of atoms       :  102 (  33 equ)
%            Maximal formula atoms :   36 (   5 avg)
%            Number of connectives :   98 (  16   ~;   9   |;  43   &)
%                                         (   1 <=>;  29  =>;   0  <=;   0 <~>)
%            Maximal formula depth :   18 (   4 avg)
%            Maximal term depth    :    2 (   1 avg)
%            Number of predicates  :    4 (   2 usr;   1 prp; 0-2 aty)
%            Number of functors    :   19 (  19 usr;  16 con; 0-3 aty)
%            Number of variables   :   29 (   0 sgn  24   !;   0   ?)

% Comments : 
%------------------------------------------------------------------------------
fof(leq_gt2,axiom,
    ! [X0,X1] :
      ( ( X0 != X1
        & leq(X0,X1) )
     => gt(X1,X0) ) ).

fof(leq_gt_pred,axiom,
    ! [X0,X1] :
      ( leq(X0,pred(X1))
    <=> gt(X1,X0) ) ).

fof(cl5_nebula_init_0011,conjecture,
    ( ( ( gt(loopcounter,n1)
       => ! [X8] :
            ( ( leq(X8,n4)
              & leq(n0,X8) )
           => 'a$uselect2'('sigmaold$uinit',X8) = init ) )
      & ( gt(loopcounter,n1)
       => ! [X7] :
            ( ( leq(X7,n4)
              & leq(n0,X7) )
           => 'a$uselect2'('rhoold$uinit',X7) = init ) )
      & ( gt(loopcounter,n1)
       => ! [X6] :
            ( ( leq(X6,n4)
              & leq(n0,X6) )
           => 'a$uselect2'('muold$uinit',X6) = init ) )
      & ! [X5] :
          ( ( leq(X5,n4)
            & leq(n0,X5) )
         => 'a$uselect3'('center$uinit',X5,n0) = init )
      & ! [X4] :
          ( ( leq(X4,pred(pv40))
            & leq(n0,X4) )
         => 'a$uselect2'('sigma$uinit',X4) = init )
      & ! [X3] :
          ( ( leq(X3,pred(pv40))
            & leq(n0,X3) )
         => 'a$uselect2'('mu$uinit',X3) = init )
      & ! [X2] :
          ( ( leq(X2,n4)
            & leq(n0,X2) )
         => 'a$uselect2'('rho$uinit',X2) = init )
      & ! [X0] :
          ( ( leq(X0,n135299)
            & leq(n0,X0) )
         => ! [X1] :
              ( ( leq(X1,n4)
                & leq(n0,X1) )
             => 'a$uselect3'('q$uinit',X0,X1) = init ) )
      & leq(pv40,n4)
      & leq(n0,pv40)
      & 'a$uselect2'('sigma$uinit',pv40) = init
      & 'a$uselect2'('mu$uinit',pv40) = init )
   => ! [X9] :
        ( ( leq(X9,pv40)
          & leq(n0,X9) )
       => 'a$uselect2'('mu$uinit',X9) = init ) ) ).

fof(negated_conjecture,negated_conjecture,
    ~ ( ( ( gt(loopcounter,n1)
         => ! [X8] :
              ( ( leq(X8,n4)
                & leq(n0,X8) )
             => 'a$uselect2'('sigmaold$uinit',X8) = init ) )
        & ( gt(loopcounter,n1)
         => ! [X7] :
              ( ( leq(X7,n4)
                & leq(n0,X7) )
             => 'a$uselect2'('rhoold$uinit',X7) = init ) )
        & ( gt(loopcounter,n1)
         => ! [X6] :
              ( ( leq(X6,n4)
                & leq(n0,X6) )
             => 'a$uselect2'('muold$uinit',X6) = init ) )
        & ! [X5] :
            ( ( leq(X5,n4)
              & leq(n0,X5) )
           => 'a$uselect3'('center$uinit',X5,n0) = init )
        & ! [X4] :
            ( ( leq(X4,pred(pv40))
              & leq(n0,X4) )
           => 'a$uselect2'('sigma$uinit',X4) = init )
        & ! [X3] :
            ( ( leq(X3,pred(pv40))
              & leq(n0,X3) )
           => 'a$uselect2'('mu$uinit',X3) = init )
        & ! [X2] :
            ( ( leq(X2,n4)
              & leq(n0,X2) )
           => 'a$uselect2'('rho$uinit',X2) = init )
        & ! [X0] :
            ( ( leq(X0,n135299)
              & leq(n0,X0) )
           => ! [X1] :
                ( ( leq(X1,n4)
                  & leq(n0,X1) )
               => 'a$uselect3'('q$uinit',X0,X1) = init ) )
        & leq(pv40,n4)
        & leq(n0,pv40)
        & 'a$uselect2'('sigma$uinit',pv40) = init
        & 'a$uselect2'('mu$uinit',pv40) = init )
     => ! [X9] :
          ( ( leq(X9,pv40)
            & leq(n0,X9) )
         => 'a$uselect2'('mu$uinit',X9) = init ) ),
    inference(negate_conjecture,[status(cth)],[cl5_nebula_init_0011]) ).

cnf(c49,plain,
    ( gt(X1,X0)
    | X0 = X1
    | ~ leq(X0,X1) ),
    inference(clausification,[status(esa)],[leq_gt2]) ).

cnf(c51,plain,
    ( ~ gt(X1,X0)
    | leq(X0,pred(X1)) ),
    inference(clausification,[status(esa)],[leq_gt_pred]) ).

cnf(c163,plain,
    'a$uselect2'('mu$uinit',pv40) = init,
    inference(clausification,[status(esa)],[negated_conjecture]) ).

cnf(c169,plain,
    ( 'a$uselect2'('mu$uinit',X0) = init
    | ~ leq(X0,pred(pv40))
    | ~ leq(n0,X0) ),
    inference(clausification,[status(esa)],[negated_conjecture]) ).

cnf(c175,plain,
    leq(n0,sK190),
    inference(clausification,[status(esa)],[negated_conjecture]) ).

cnf(c176,plain,
    leq(sK190,pv40),
    inference(clausification,[status(esa)],[negated_conjecture]) ).

cnf(c177,plain,
    'a$uselect2'('mu$uinit',sK190) != init,
    inference(clausification,[status(esa)],[negated_conjecture]) ).

cnf(d0,plain,
    ( gt(pv40,sK190)
    | sK190 = pv40 ),
    inference(resolution,[status(thm)],[c49,c176]) ).

cnf(d1,plain,
    ( ~ leq(n0,sK190)
    | ~ leq(sK190,pred(pv40))
    | init != init ),
    inference(superposition,[status(thm)],[c169,c177]) ).

cnf(d2,plain,
    ( ~ leq(sK190,pred(pv40))
    | init != init ),
    inference(resolution,[status(thm)],[c175,d1]) ).

cnf(d3,plain,
    ~ leq(sK190,pred(pv40)),
    inference(equality_resolution,[status(thm)],[d2]) ).

cnf(d4,plain,
    ~ gt(pv40,sK190),
    inference(resolution,[status(thm)],[c51,d3]) ).

cnf(d5,plain,
    sK190 = pv40,
    inference(resolution,[status(thm)],[d4,d0]) ).

cnf(d6,plain,
    'a$uselect2'('mu$uinit',pv40) != init,
    inference(demodulation,[status(thm)],[c177,d5]) ).

cnf(d7,plain,
    init != init,
    inference(demodulation,[status(thm)],[d6,c163]) ).

cnf(d8,plain,
    $false,
    inference(equality_resolution,[status(thm)],[d7]) ).

%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.00/0.03  % Problem  : SWV167+1 : TPTP v9.3.1. Bugfixed v3.3.0.
% 0.00/0.04  % Command  : casc-portfolio.sh -t 300 /export/starexec/sandbox2/benchmark/theBenchmark.p
% 0.10/0.36  % Computer : n006.cluster.edu
% 0.10/0.36  % Model    : x86_64 x86_64
% 0.10/0.36  % CPU      : Intel(R) Xeon(R) CPU E5-2620 v4 @ 2.10GHz
% 0.10/0.36  % Memory   : 8046.5625MB
% 0.10/0.36  % OS       : Linux 6.8.0-71-generic
% 0.10/0.36  % CPULimit : 300
% 0.10/0.36  % WCLimit  : 300
% 0.10/0.36  % DateTime : Sat Sep 26 13:17:10 UTC 2026
% 0.10/0.36  % CPUTime  : 
% 0.10/0.36  Running casc-portfolio.sh -t 300 /export/starexec/sandbox2/benchmark/theBenchmark.p
% 34.82/8.76  % SZS status Theorem for theBenchmark.p
% 34.82/8.76  % SZS output start CNFRefutation for theBenchmark.p
% See solution above
%------------------------------------------------------------------------------