↑ Up

LisaST---0.9.THM-CRf.s

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

% Computer : n009.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:02:26 AM UTC 2026

% Result   : Theorem 28.42s 4.11s
% Output   : CNFRefutation 28.42s
% Verified : 
% SZS Type : Refutation
%            Derivation depth      :   12
%            Number of leaves      :    2
% Syntax   : Number of formulae    :   27 (  14 unt;   0 def)
%            Number of atoms       :  158 (  66 equ)
%            Maximal formula atoms :   49 (   5 avg)
%            Number of connectives :  211 (  80   ~;  40   |;  50   &)
%                                         (   1 <=>;  40  =>;   0  <=;   0 <~>)
%            Maximal formula depth :   25 (   5 avg)
%            Maximal term depth    :    4 (   2 avg)
%            Number of predicates  :    5 (   3 usr;   1 prp; 0-2 aty)
%            Number of functors    :   25 (  25 usr;  17 con; 0-2 aty)
%            Number of variables   :   76 (   3 sgn  59   !;   0   ?)

% Comments : 
%------------------------------------------------------------------------------
fof(axiom_46,axiom,
    ! [X0,X1,X2] :
      ( elem(X0,cons(X1,X2))
    <=> ( elem(X0,X2)
        | X0 = X1 ) ) ).

fof(conj,conjecture,
    ! [X0,X1,X2,X3] :
      ( ( queue(host(X2)) = cons('m$uDown'(X3),X0)
        & ! [X4,X7,X6,X5] :
            ( ( host(X5) = host(X6)
              & host(X7) = host(X4)
              & setIn(X6,alive)
              & setIn(X4,alive)
              & host(X6) != host(X4) )
           => ~ ( elem('m$uDown'(X7),queue(host(X6)))
                & elem('m$uDown'(X5),queue(host(X4))) ) )
        & ! [X4,X5] :
            ( ( host(X5) = host(X4)
              & X5 != X4 )
           => ( ~ setIn(X5,alive)
              | ~ setIn(X4,alive) ) )
        & ! [X4,X5] :
            ( ( host(X5) = host(X4)
              & leq(X5,X4)
              & ~ setIn(X4,alive) )
           => ~ setIn(X5,alive) )
        & ! [X4,X6,X5] :
            ( elem('m$uAck'(X5,X4),queue(host(X6)))
           => ~ leq(host(X4),host(X5)) )
        & ! [X4,X5] :
            ( elem('m$uHalt'(X5),queue(host(X4)))
           => ~ leq(host(X4),host(X5)) )
        & ! [X4,X5] :
            ( elem('m$uDown'(X5),queue(host(X4)))
           => host(X5) != host(X4) )
        & ! [X4,X5] :
            ( elem('m$uDown'(X5),queue(host(X4)))
           => ~ setIn(X5,alive) )
        & ! [X4,X5] :
            ( setIn(X5,alive)
           => ~ elem('m$uDown'(X5),queue(host(X4))) ) )
     => ( setIn(X2,alive)
       => ( ~ leq(host(X2),host(X3))
         => ( ~ ( ( host(X3) = host(index(elid,host(X2)))
                  & index(status,host(X2)) = wait )
                | ( index(status,host(X2)) = norm
                  & index(ldr,host(X2)) = host(X3) ) )
           => ( ( index(status,host(X2)) = 'elec$u1'
                & ! [X4] :
                    ( ( leq(s(zero),X4)
                      & ~ leq(host(X2),X4) )
                   => ( X4 = host(X3)
                      | setIn(X4,index(down,host(X2))) ) ) )
             => ( ~ leq('nbr$uproc',host(X2))
               => ! [X4] :
                    ( s(host(X2)) != host(X4)
                   => ( host(X2) = host(X4)
                     => ! [X8,X9] :
                          ( s(host(X2)) != host(X9)
                         => ( host(X2) != host(X9)
                           => ! [X10] :
                                ( ( host(X10) = host(X9)
                                  & host(X8) = host(X4)
                                  & setIn(X9,alive)
                                  & setIn(X4,alive)
                                  & host(X9) != host(X4) )
                               => ~ ( elem('m$uDown'(X8),queue(host(X9)))
                                    & elem('m$uDown'(X10),X0) ) ) ) ) ) ) ) ) ) ) ) ) ).

fof(negated_conjecture,negated_conjecture,
    ~ ! [X0,X1,X2,X3] :
        ( ( queue(host(X2)) = cons('m$uDown'(X3),X0)
          & ! [X4,X7,X6,X5] :
              ( ( host(X5) = host(X6)
                & host(X7) = host(X4)
                & setIn(X6,alive)
                & setIn(X4,alive)
                & host(X6) != host(X4) )
             => ~ ( elem('m$uDown'(X7),queue(host(X6)))
                  & elem('m$uDown'(X5),queue(host(X4))) ) )
          & ! [X4,X5] :
              ( ( host(X5) = host(X4)
                & X5 != X4 )
             => ( ~ setIn(X5,alive)
                | ~ setIn(X4,alive) ) )
          & ! [X4,X5] :
              ( ( host(X5) = host(X4)
                & leq(X5,X4)
                & ~ setIn(X4,alive) )
             => ~ setIn(X5,alive) )
          & ! [X4,X6,X5] :
              ( elem('m$uAck'(X5,X4),queue(host(X6)))
             => ~ leq(host(X4),host(X5)) )
          & ! [X4,X5] :
              ( elem('m$uHalt'(X5),queue(host(X4)))
             => ~ leq(host(X4),host(X5)) )
          & ! [X4,X5] :
              ( elem('m$uDown'(X5),queue(host(X4)))
             => host(X5) != host(X4) )
          & ! [X4,X5] :
              ( elem('m$uDown'(X5),queue(host(X4)))
             => ~ setIn(X5,alive) )
          & ! [X4,X5] :
              ( setIn(X5,alive)
             => ~ elem('m$uDown'(X5),queue(host(X4))) ) )
       => ( setIn(X2,alive)
         => ( ~ leq(host(X2),host(X3))
           => ( ~ ( ( host(X3) = host(index(elid,host(X2)))
                    & index(status,host(X2)) = wait )
                  | ( index(status,host(X2)) = norm
                    & index(ldr,host(X2)) = host(X3) ) )
             => ( ( index(status,host(X2)) = 'elec$u1'
                  & ! [X4] :
                      ( ( leq(s(zero),X4)
                        & ~ leq(host(X2),X4) )
                     => ( X4 = host(X3)
                        | setIn(X4,index(down,host(X2))) ) ) )
               => ( ~ leq('nbr$uproc',host(X2))
                 => ! [X4] :
                      ( s(host(X2)) != host(X4)
                     => ( host(X2) = host(X4)
                       => ! [X8,X9] :
                            ( s(host(X2)) != host(X9)
                           => ( host(X2) != host(X9)
                             => ! [X10] :
                                  ( ( host(X10) = host(X9)
                                    & host(X8) = host(X4)
                                    & setIn(X9,alive)
                                    & setIn(X4,alive)
                                    & host(X9) != host(X4) )
                                 => ~ ( elem('m$uDown'(X8),queue(host(X9)))
                                      & elem('m$uDown'(X10),X0) ) ) ) ) ) ) ) ) ) ) ) ),
    inference(negate_conjecture,[status(cth)],[conj]) ).

cnf(c54,plain,
    ( ~ elem(X0,X2)
    | elem(X0,cons(X1,X2)) ),
    inference(clausification,[status(esa)],[axiom_46]) ).

cnf(c107,plain,
    ( host(X1) = host(X2)
    | ~ setIn(X2,alive)
    | host(X3) != host(X2)
    | ~ setIn(X1,alive)
    | ~ elem('m$uDown'(X3),queue(host(X1)))
    | ~ elem('m$uDown'(X0),queue(host(X2)))
    | host(X0) != host(X1) ),
    inference(clausification,[status(esa)],[negated_conjecture]) ).

cnf(c108,plain,
    queue(host(sK126)) = cons('m$uDown'(sK127),sK124),
    inference(clausification,[status(esa)],[negated_conjecture]) ).

cnf(c109,plain,
    setIn(sK126,alive),
    inference(clausification,[status(esa)],[negated_conjecture]) ).

cnf(c117,plain,
    host(sK126) = host(sK148),
    inference(clausification,[status(esa)],[negated_conjecture]) ).

cnf(c120,plain,
    host(sK150) != host(sK148),
    inference(clausification,[status(esa)],[negated_conjecture]) ).

cnf(c122,plain,
    setIn(sK150,alive),
    inference(clausification,[status(esa)],[negated_conjecture]) ).

cnf(c123,plain,
    host(sK149) = host(sK148),
    inference(clausification,[status(esa)],[negated_conjecture]) ).

cnf(c124,plain,
    host(sK151) = host(sK150),
    inference(clausification,[status(esa)],[negated_conjecture]) ).

cnf(c125,plain,
    elem('m$uDown'(sK151),sK124),
    inference(clausification,[status(esa)],[negated_conjecture]) ).

cnf(c126,plain,
    elem('m$uDown'(sK149),queue(host(sK150))),
    inference(clausification,[status(esa)],[negated_conjecture]) ).

cnf(d0,plain,
    ( ~ setIn(X0,alive)
    | ~ setIn(X2,alive)
    | ~ elem('m$uDown'(sK151),queue(host(X2)))
    | ~ elem('m$uDown'(X1),queue(host(X0)))
    | host(X0) = host(X2)
    | host(X1) != host(X2)
    | host(sK150) != host(X0) ),
    inference(superposition,[status(thm)],[c124,c107]) ).

cnf(d1,plain,
    ( ~ setIn(sK150,alive)
    | ~ setIn(X1,alive)
    | ~ elem('m$uDown'(sK151),queue(host(X1)))
    | ~ elem('m$uDown'(X0),queue(host(sK150)))
    | host(sK150) = host(X1)
    | host(X0) != host(X1) ),
    inference(equality_resolution,[status(thm)],[d0]) ).

cnf(d2,plain,
    ( ~ setIn(X1,alive)
    | ~ elem('m$uDown'(sK151),queue(host(X1)))
    | ~ elem('m$uDown'(X0),queue(host(sK150)))
    | host(sK150) = host(X1)
    | host(X0) != host(X1) ),
    inference(resolution,[status(thm)],[c122,d1]) ).

cnf(d3,plain,
    host(sK149) = host(sK126),
    inference(demodulation,[status(thm)],[c123,c117]) ).

cnf(d4,plain,
    ( ~ setIn(X0,alive)
    | ~ elem('m$uDown'(sK151),queue(host(X0)))
    | ~ elem('m$uDown'(sK149),queue(host(sK150)))
    | host(sK150) = host(X0)
    | host(sK126) != host(X0) ),
    inference(superposition,[status(thm)],[d3,d2]) ).

cnf(d5,plain,
    ( ~ setIn(X0,alive)
    | ~ elem('m$uDown'(sK151),queue(host(X0)))
    | host(sK150) = host(X0)
    | host(sK126) != host(X0) ),
    inference(resolution,[status(thm)],[c126,d4]) ).

cnf(d6,plain,
    ( ~ setIn(sK126,alive)
    | ~ elem('m$uDown'(sK151),queue(host(sK126)))
    | host(sK150) = host(sK126) ),
    inference(equality_resolution,[status(thm)],[d5]) ).

cnf(d7,plain,
    ( ~ elem('m$uDown'(sK151),queue(host(sK126)))
    | host(sK150) = host(sK126) ),
    inference(resolution,[status(thm)],[c109,d6]) ).

cnf(d8,plain,
    host(sK150) != host(sK126),
    inference(demodulation,[status(thm)],[c120,c117]) ).

cnf(d9,plain,
    ~ elem('m$uDown'(sK151),queue(host(sK126))),
    inference(resolution,[status(thm)],[d8,d7]) ).

cnf(d10,plain,
    ( ~ elem(X0,sK124)
    | elem(X0,queue(host(sK126))) ),
    inference(superposition,[status(thm)],[c108,c54]) ).

cnf(d11,plain,
    ~ elem('m$uDown'(sK151),sK124),
    inference(resolution,[status(thm)],[d10,d9]) ).

cnf(d12,plain,
    $false,
    inference(resolution,[status(thm)],[c125,d11]) ).

%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.00/0.02  % Problem  : SWV454+1 : TPTP v9.3.1. Released v4.0.0.
% 0.00/0.03  % Command  : casc-portfolio.sh -t 300 /export/starexec/sandbox/benchmark/theBenchmark.p
% 0.10/0.36  % Computer : n009.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:54:29 UTC 2026
% 0.10/0.37  % CPUTime  : 
% 0.10/0.37  Running casc-portfolio.sh -t 300 /export/starexec/sandbox/benchmark/theBenchmark.p
% 28.42/4.11  % SZS status Theorem for theBenchmark.p
% 28.42/4.11  % SZS output start CNFRefutation for theBenchmark.p
% See solution above
%------------------------------------------------------------------------------