↑ Up

LisaST---0.9.THM-CRf.s

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

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

% Result   : Theorem 21.51s 4.01s
% Output   : CNFRefutation 21.51s
% Verified : 
% SZS Type : Refutation
%            Derivation depth      :   12
%            Number of leaves      :    9
% Syntax   : Number of formulae    :   39 (  18 unt;   0 def)
%            Number of atoms       :  115 (  24 equ)
%            Maximal formula atoms :   25 (   2 avg)
%            Number of connectives :   97 (  21   ~;  23   |;  28   &)
%                                         (   1 <=>;  24  =>;   0  <=;   0 <~>)
%            Maximal formula depth :   13 (   3 avg)
%            Maximal term depth    :    2 (   1 avg)
%            Number of predicates  :    4 (   2 usr;   1 prp; 0-2 aty)
%            Number of functors    :   18 (  18 usr;  14 con; 0-3 aty)
%            Number of variables   :   45 (   0 sgn  26   !;   0   ?)

% Comments : 
%------------------------------------------------------------------------------
fof(gt_1_0,axiom,
    gt(n1,n0) ).

fof(successor_1,axiom,
    succ(n0) = n1 ).

fof(totality,axiom,
    ! [X0,X1] :
      ( X0 = X1
      | gt(X1,X0)
      | gt(X0,X1) ) ).

fof(transitivity_gt,axiom,
    ! [X0,X1,X2] :
      ( ( gt(X1,X2)
        & gt(X0,X1) )
     => gt(X0,X2) ) ).

fof(irreflexivity_gt,axiom,
    ! [X0] : ~ gt(X0,X0) ).

fof(transitivity_leq,axiom,
    ! [X0,X1,X2] :
      ( ( leq(X1,X2)
        & leq(X0,X1) )
     => leq(X0,X2) ) ).

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

fof(gt_succ,axiom,
    ! [X0] : gt(succ(X0),X0) ).

fof(cl5_nebula_init_0086,conjecture,
    ( ( ( gt(loopcounter,n0)
       => ! [X5] :
            ( ( leq(X5,n4)
              & leq(n0,X5) )
           => 'a$uselect2'('sigma$uinit',X5) = init ) )
      & ( gt(loopcounter,n0)
       => ! [X4] :
            ( ( leq(X4,n4)
              & leq(n0,X4) )
           => 'a$uselect2'('rho$uinit',X4) = init ) )
      & ( gt(loopcounter,n0)
       => ! [X3] :
            ( ( leq(X3,n4)
              & leq(n0,X3) )
           => 'a$uselect2'('mu$uinit',X3) = init ) )
      & ! [X2] :
          ( ( leq(X2,n4)
            & leq(n0,X2) )
         => 'a$uselect3'('center$uinit',X2,n0) = init )
      & ! [X0] :
          ( ( leq(X0,n135299)
            & leq(n0,X0) )
         => ! [X1] :
              ( ( leq(X1,n4)
                & leq(n0,X1) )
             => 'a$uselect3'('q$uinit',X0,X1) = init ) )
      & leq(n1,loopcounter)
      & leq('tptp$ufloat$u0$u001',pv76) )
   => ! [X6] :
        ( ( leq(X6,n4)
          & leq(n0,X6) )
       => 'a$uselect2'('rho$uinit',X6) = init ) ) ).

fof(negated_conjecture,negated_conjecture,
    ~ ( ( ( gt(loopcounter,n0)
         => ! [X5] :
              ( ( leq(X5,n4)
                & leq(n0,X5) )
             => 'a$uselect2'('sigma$uinit',X5) = init ) )
        & ( gt(loopcounter,n0)
         => ! [X4] :
              ( ( leq(X4,n4)
                & leq(n0,X4) )
             => 'a$uselect2'('rho$uinit',X4) = init ) )
        & ( gt(loopcounter,n0)
         => ! [X3] :
              ( ( leq(X3,n4)
                & leq(n0,X3) )
             => 'a$uselect2'('mu$uinit',X3) = init ) )
        & ! [X2] :
            ( ( leq(X2,n4)
              & leq(n0,X2) )
           => 'a$uselect3'('center$uinit',X2,n0) = init )
        & ! [X0] :
            ( ( leq(X0,n135299)
              & leq(n0,X0) )
           => ! [X1] :
                ( ( leq(X1,n4)
                  & leq(n0,X1) )
               => 'a$uselect3'('q$uinit',X0,X1) = init ) )
        & leq(n1,loopcounter)
        & leq('tptp$ufloat$u0$u001',pv76) )
     => ! [X6] :
          ( ( leq(X6,n4)
            & leq(n0,X6) )
         => 'a$uselect2'('rho$uinit',X6) = init ) ),
    inference(negate_conjecture,[status(cth)],[cl5_nebula_init_0086]) ).

cnf(c13,plain,
    gt(n1,n0),
    inference(clausification,[status(esa)],[gt_1_0]) ).

cnf(c36,plain,
    succ(n0) = n1,
    inference(clausification,[status(esa)],[successor_1]) ).

cnf(c39,plain,
    ( X0 = X1
    | gt(X1,X0)
    | gt(X0,X1) ),
    inference(clausification,[status(esa)],[totality]) ).

cnf(c40,plain,
    ( gt(X0,X2)
    | ~ gt(X1,X2)
    | ~ gt(X0,X1) ),
    inference(clausification,[status(esa)],[transitivity_gt]) ).

cnf(c41,plain,
    ~ gt(X0,X0),
    inference(clausification,[status(esa)],[irreflexivity_gt]) ).

cnf(c43,plain,
    ( leq(X0,X2)
    | ~ leq(X1,X2)
    | ~ leq(X0,X1) ),
    inference(clausification,[status(esa)],[transitivity_leq]) ).

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

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

cnf(c52,plain,
    gt(succ(X0),X0),
    inference(clausification,[status(esa)],[gt_succ]) ).

cnf(c164,plain,
    leq(n1,loopcounter),
    inference(clausification,[status(esa)],[negated_conjecture]) ).

cnf(c168,plain,
    ( 'a$uselect2'('rho$uinit',X0) = init
    | ~ leq(X0,n4)
    | ~ leq(n0,X0)
    | ~ gt(loopcounter,n0) ),
    inference(clausification,[status(esa)],[negated_conjecture]) ).

cnf(c170,plain,
    leq(n0,sK187),
    inference(clausification,[status(esa)],[negated_conjecture]) ).

cnf(c171,plain,
    leq(sK187,n4),
    inference(clausification,[status(esa)],[negated_conjecture]) ).

cnf(c172,plain,
    'a$uselect2'('rho$uinit',sK187) != init,
    inference(clausification,[status(esa)],[negated_conjecture]) ).

cnf(d0,plain,
    ( ~ leq(sK187,n4)
    | ~ gt(loopcounter,n0)
    | 'a$uselect2'('rho$uinit',sK187) = init ),
    inference(resolution,[status(thm)],[c168,c170]) ).

cnf(d1,plain,
    ( ~ gt(loopcounter,n0)
    | 'a$uselect2'('rho$uinit',sK187) = init ),
    inference(resolution,[status(thm)],[c171,d0]) ).

cnf(d2,plain,
    ~ gt(loopcounter,n0),
    inference(resolution,[status(thm)],[c172,d1]) ).

cnf(d3,plain,
    ( gt(n0,loopcounter)
    | loopcounter = n0 ),
    inference(resolution,[status(thm)],[c39,d2]) ).

cnf(d4,plain,
    ( leq(n1,X0)
    | ~ leq(loopcounter,X0) ),
    inference(resolution,[status(thm)],[c43,c164]) ).

cnf(d5,plain,
    ( ~ gt(X0,loopcounter)
    | leq(n1,pred(X0)) ),
    inference(resolution,[status(thm)],[d4,c51]) ).

cnf(d6,plain,
    ( gt(X0,n1)
    | ~ gt(X0,loopcounter) ),
    inference(resolution,[status(thm)],[d5,c50]) ).

cnf(d7,plain,
    ( loopcounter = n0
    | gt(n0,n1) ),
    inference(resolution,[status(thm)],[d6,d3]) ).

cnf(d8,plain,
    ( gt(n1,X0)
    | ~ gt(n0,X0) ),
    inference(resolution,[status(thm)],[c40,c13]) ).

cnf(d9,plain,
    ( loopcounter = n0
    | gt(n1,n1) ),
    inference(resolution,[status(thm)],[d8,d7]) ).

cnf(d10,plain,
    loopcounter = n0,
    inference(resolution,[status(thm)],[c41,d9]) ).

cnf(d11,plain,
    gt(succ(loopcounter),n1),
    inference(resolution,[status(thm)],[d6,c52]) ).

cnf(d12,plain,
    gt(succ(n0),n1),
    inference(demodulation,[status(thm)],[d11,d10]) ).

cnf(d13,plain,
    gt(n1,n1),
    inference(demodulation,[status(thm)],[d12,c36]) ).

cnf(d14,plain,
    $false,
    inference(resolution,[status(thm)],[c41,d13]) ).

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