TSTP Solution File: SYN726+1 by Drodi---3.5.1

View Problem - Process Solution

%------------------------------------------------------------------------------
% File     : Drodi---3.5.1
% Problem  : SYN726+1 : TPTP v8.1.2. Released v2.5.0.
% Transfm  : none
% Format   : tptp:raw
% Command  : drodi -learnfrom(drodi.lrn) -timeout(%d) %s

% Computer : n016.cluster.edu
% Model    : x86_64 x86_64
% CPU      : Intel(R) Xeon(R) CPU E5-2620 v4 2.10GHz
% Memory   : 8042.1875MB
% OS       : Linux 3.10.0-693.el7.x86_64
% CPULimit : 300s
% WCLimit  : 300s
% DateTime : Wed May 31 12:47:29 EDT 2023

% Result   : Theorem 0.12s 0.34s
% Output   : CNFRefutation 0.12s
% Verified : 
% SZS Type : Refutation
%            Derivation depth      :   15
%            Number of leaves      :    1
% Syntax   : Number of formulae    :   30 (   8 unt;   0 def)
%            Number of atoms       :  110 (   0 equ)
%            Maximal formula atoms :   12 (   3 avg)
%            Number of connectives :  115 (  35   ~;  47   |;  25   &)
%                                         (   0 <=>;   8  =>;   0  <=;   0 <~>)
%            Maximal formula depth :   11 (   5 avg)
%            Maximal term depth    :    1 (   1 avg)
%            Number of predicates  :    3 (   2 usr;   1 prp; 0-2 aty)
%            Number of functors    :    4 (   4 usr;   4 con; 0-0 aty)
%            Number of variables   :  107 (;  99   !;   8   ?)

% Comments : 
%------------------------------------------------------------------------------
fof(f1,conjecture,
    ( ( ( ! [X,Y,Z] :
            ( ( p(X,Y)
              & p(Y,Z) )
           => p(X,Z) )
        & ! [X,Y,Z] :
            ( ( q(X,Y)
              & q(Y,Z) )
           => q(X,Z) )
        & ! [X,Y] :
            ( q(X,Y)
           => q(Y,X) )
        & ! [X,Y] :
            ( p(X,Y)
            | q(X,Y) ) )
     => ! [X,Y] : p(X,Y) )
    | ! [X,Y] : q(X,Y) ),
    file('/export/starexec/sandbox2/benchmark/theBenchmark.p') ).

fof(f2,negated_conjecture,
    ~ ( ( ( ! [X,Y,Z] :
              ( ( p(X,Y)
                & p(Y,Z) )
             => p(X,Z) )
          & ! [X,Y,Z] :
              ( ( q(X,Y)
                & q(Y,Z) )
             => q(X,Z) )
          & ! [X,Y] :
              ( q(X,Y)
             => q(Y,X) )
          & ! [X,Y] :
              ( p(X,Y)
              | q(X,Y) ) )
       => ! [X,Y] : p(X,Y) )
      | ! [X,Y] : q(X,Y) ),
    inference(negated_conjecture,[status(cth)],[f1]) ).

fof(f3,plain,
    ( ! [X,Y,Z] :
        ( ~ p(X,Y)
        | ~ p(Y,Z)
        | p(X,Z) )
    & ! [X,Y,Z] :
        ( ~ q(X,Y)
        | ~ q(Y,Z)
        | q(X,Z) )
    & ! [X,Y] :
        ( ~ q(X,Y)
        | q(Y,X) )
    & ! [X,Y] :
        ( p(X,Y)
        | q(X,Y) )
    & ? [X,Y] : ~ p(X,Y)
    & ? [X,Y] : ~ q(X,Y) ),
    inference(pre_NNF_transformation,[status(esa)],[f2]) ).

fof(f4,plain,
    ( ! [X,Z] :
        ( ! [Y] :
            ( ~ p(X,Y)
            | ~ p(Y,Z) )
        | p(X,Z) )
    & ! [X,Z] :
        ( ! [Y] :
            ( ~ q(X,Y)
            | ~ q(Y,Z) )
        | q(X,Z) )
    & ! [X,Y] :
        ( ~ q(X,Y)
        | q(Y,X) )
    & ! [X,Y] :
        ( p(X,Y)
        | q(X,Y) )
    & ? [X,Y] : ~ p(X,Y)
    & ? [X,Y] : ~ q(X,Y) ),
    inference(miniscoping,[status(esa)],[f3]) ).

fof(f5,plain,
    ( ! [X,Z] :
        ( ! [Y] :
            ( ~ p(X,Y)
            | ~ p(Y,Z) )
        | p(X,Z) )
    & ! [X,Z] :
        ( ! [Y] :
            ( ~ q(X,Y)
            | ~ q(Y,Z) )
        | q(X,Z) )
    & ! [X,Y] :
        ( ~ q(X,Y)
        | q(Y,X) )
    & ! [X,Y] :
        ( p(X,Y)
        | q(X,Y) )
    & ~ p(sk0_0,sk0_1)
    & ~ q(sk0_2,sk0_3) ),
    inference(skolemization,[status(esa)],[f4]) ).

fof(f6,plain,
    ! [X0,X1,X2] :
      ( ~ p(X0,X1)
      | ~ p(X1,X2)
      | p(X0,X2) ),
    inference(cnf_transformation,[status(esa)],[f5]) ).

fof(f7,plain,
    ! [X0,X1,X2] :
      ( ~ q(X0,X1)
      | ~ q(X1,X2)
      | q(X0,X2) ),
    inference(cnf_transformation,[status(esa)],[f5]) ).

fof(f8,plain,
    ! [X0,X1] :
      ( ~ q(X0,X1)
      | q(X1,X0) ),
    inference(cnf_transformation,[status(esa)],[f5]) ).

fof(f9,plain,
    ! [X0,X1] :
      ( p(X0,X1)
      | q(X0,X1) ),
    inference(cnf_transformation,[status(esa)],[f5]) ).

fof(f10,plain,
    ~ p(sk0_0,sk0_1),
    inference(cnf_transformation,[status(esa)],[f5]) ).

fof(f11,plain,
    ~ q(sk0_2,sk0_3),
    inference(cnf_transformation,[status(esa)],[f5]) ).

fof(f12,plain,
    p(sk0_2,sk0_3),
    inference(resolution,[status(thm)],[f9,f11]) ).

fof(f13,plain,
    ! [X0,X1] :
      ( p(X0,X1)
      | q(X1,X0) ),
    inference(resolution,[status(thm)],[f9,f8]) ).

fof(f14,plain,
    ! [X0] :
      ( ~ p(X0,sk0_2)
      | p(X0,sk0_3) ),
    inference(resolution,[status(thm)],[f6,f12]) ).

fof(f15,plain,
    p(sk0_3,sk0_2),
    inference(resolution,[status(thm)],[f13,f11]) ).

fof(f17,plain,
    ! [X0] :
      ( ~ p(X0,sk0_3)
      | p(X0,sk0_2) ),
    inference(resolution,[status(thm)],[f15,f6]) ).

fof(f22,plain,
    ! [X0,X1,X2] :
      ( ~ q(X0,X1)
      | q(X0,X2)
      | p(X2,X1) ),
    inference(resolution,[status(thm)],[f7,f13]) ).

fof(f23,plain,
    ! [X0,X1,X2] :
      ( ~ q(X0,X1)
      | q(X0,X2)
      | p(X1,X2) ),
    inference(resolution,[status(thm)],[f7,f9]) ).

fof(f25,plain,
    ! [X0,X1,X2] :
      ( q(X0,X1)
      | p(X1,X2)
      | p(X0,X2) ),
    inference(resolution,[status(thm)],[f22,f9]) ).

fof(f26,plain,
    ! [X0,X1,X2] :
      ( q(X0,X1)
      | p(X2,X1)
      | p(X2,X0) ),
    inference(resolution,[status(thm)],[f23,f13]) ).

fof(f33,plain,
    ! [X0] :
      ( p(X0,sk0_3)
      | p(X0,sk0_2) ),
    inference(resolution,[status(thm)],[f26,f11]) ).

fof(f34,plain,
    ! [X0] : p(X0,sk0_2),
    inference(forward_subsumption_resolution,[status(thm)],[f33,f17]) ).

fof(f44,plain,
    ! [X0] : p(X0,sk0_3),
    inference(backward_subsumption_resolution,[status(thm)],[f14,f34]) ).

fof(f47,plain,
    ! [X0] :
      ( p(sk0_3,X0)
      | p(sk0_2,X0) ),
    inference(resolution,[status(thm)],[f25,f11]) ).

fof(f52,plain,
    ! [X0,X1] :
      ( p(sk0_2,X0)
      | ~ p(X1,sk0_3)
      | p(X1,X0) ),
    inference(resolution,[status(thm)],[f47,f6]) ).

fof(f53,plain,
    ! [X0,X1] :
      ( p(sk0_2,X0)
      | p(X1,X0) ),
    inference(forward_subsumption_resolution,[status(thm)],[f52,f44]) ).

fof(f54,plain,
    ! [X0,X1,X2] :
      ( p(X0,X1)
      | ~ p(X2,sk0_2)
      | p(X2,X1) ),
    inference(resolution,[status(thm)],[f53,f6]) ).

fof(f55,plain,
    ! [X0,X1,X2] :
      ( p(X0,X1)
      | p(X2,X1) ),
    inference(forward_subsumption_resolution,[status(thm)],[f54,f34]) ).

fof(f57,plain,
    ! [X0] : p(X0,sk0_1),
    inference(resolution,[status(thm)],[f55,f10]) ).

fof(f58,plain,
    $false,
    inference(backward_subsumption_resolution,[status(thm)],[f10,f57]) ).

%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.10/0.11  % Problem  : SYN726+1 : TPTP v8.1.2. Released v2.5.0.
% 0.10/0.12  % Command  : drodi -learnfrom(drodi.lrn) -timeout(%d) %s
% 0.12/0.32  % Computer : n016.cluster.edu
% 0.12/0.32  % Model    : x86_64 x86_64
% 0.12/0.32  % CPU      : Intel(R) Xeon(R) CPU E5-2620 v4 @ 2.10GHz
% 0.12/0.32  % Memory   : 8042.1875MB
% 0.12/0.32  % OS       : Linux 3.10.0-693.el7.x86_64
% 0.12/0.32  % CPULimit : 300
% 0.12/0.32  % WCLimit  : 300
% 0.12/0.32  % DateTime : Tue May 30 10:56:44 EDT 2023
% 0.12/0.32  % CPUTime  : 
% 0.12/0.33  % Drodi V3.5.1
% 0.12/0.34  % Refutation found
% 0.12/0.34  % SZS status Theorem for theBenchmark: Theorem is valid
% 0.12/0.34  % SZS output start CNFRefutation for theBenchmark
% See solution above
% 0.18/0.56  % Elapsed time: 0.014873 seconds
% 0.18/0.56  % CPU time: 0.048405 seconds
% 0.18/0.56  % Memory used: 1.980 MB
%------------------------------------------------------------------------------