↑ Up

Drodi---4.1.1.THM-CRf.s

View TPTP
Problem
Process solution in
SystemOnTSTP
Download .tgz
%------------------------------------------------------------------------------
% File     : Drodi---4.1.1
% Problem  : PUZ047+1 : TPTP v9.3.1. Released v2.5.0.
% Transfm  : none
% Format   : tptp:raw
% Command  : drodi -timeout(300) /export/starexec/sandbox/benchmark/theBenchmark.p

% Computer : n001.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 : Thu Sep 24 01:59:58 PM UTC 2026

% Result   : Theorem 0.19s 5.53s
% Output   : CNFRefutation 0.19s
% Verified : 
% SZS Type : Refutation
%            Derivation depth      :   11
%            Number of leaves      :    1
% Syntax   : Number of formulae    :   19 (  10 unt;   0 def)
%            Number of atoms       :  112 (   0 equ)
%            Maximal formula atoms :   30 (   5 avg)
%            Number of connectives :  123 (  30   ~;  20   |;  43   &)
%                                         (   0 <=>;  30  =>;   0  <=;   0 <~>)
%            Maximal formula depth :   19 (   6 avg)
%            Maximal term depth    :    2 (   1 avg)
%            Number of predicates  :    2 (   1 usr;   1 prp; 0-5 aty)
%            Number of functors    :    7 (   7 usr;   3 con; 0-1 aty)
%            Number of variables   :   75 (  73   !;   2   ?)

% Comments : 
%------------------------------------------------------------------------------
fof(f1,conjecture,
    ( ( ! [V1] :
          ( p(north,south,north,north,V1)
         => p(south,south,north,south,take_cabbage(V1)) )
      & ! [U1] :
          ( p(south,south,north,south,U1)
         => p(north,south,north,north,take_cabbage(U1)) )
      & ! [T9] :
          ( p(north,north,south,north,T9)
         => p(south,north,south,south,take_cabbage(T9)) )
      & ! [T8] :
          ( p(south,north,south,south,T8)
         => p(north,north,south,north,take_cabbage(T8)) )
      & ! [X1,Y1,V] :
          ( p(north,X1,north,Y1,V)
         => p(south,X1,south,Y1,take_goat(V)) )
      & ! [X,Y,U] :
          ( p(south,X,south,Y,U)
         => p(north,X,north,Y,take_goat(U)) )
      & ! [T7] :
          ( p(north,north,north,south,T7)
         => p(south,south,north,south,take_wolf(T7)) )
      & ! [T6] :
          ( p(south,south,north,south,T6)
         => p(north,north,north,south,take_wolf(T6)) )
      & ! [T5] :
          ( p(north,north,south,north,T5)
         => p(south,south,south,north,take_wolf(T5)) )
      & ! [T4] :
          ( p(south,south,south,north,T4)
         => p(north,north,south,north,take_wolf(T4)) )
      & ! [T3] :
          ( p(north,south,north,south,T3)
         => p(south,south,north,south,go_alone(T3)) )
      & ! [T2] :
          ( p(south,south,north,south,T2)
         => p(north,south,north,south,go_alone(T2)) )
      & ! [T1] :
          ( p(north,north,south,north,T1)
         => p(south,north,south,north,go_alone(T1)) )
      & ! [T] :
          ( p(south,north,south,north,T)
         => p(north,north,south,north,go_alone(T)) )
      & p(south,south,south,south,start) )
   => ? [Z] : p(north,north,north,north,Z) ),
    file('/export/starexec/sandbox/benchmark/theBenchmark.p') ).

fof(f2,negated_conjecture,
    ~ ( ( ! [V1] :
            ( p(north,south,north,north,V1)
           => p(south,south,north,south,take_cabbage(V1)) )
        & ! [U1] :
            ( p(south,south,north,south,U1)
           => p(north,south,north,north,take_cabbage(U1)) )
        & ! [T9] :
            ( p(north,north,south,north,T9)
           => p(south,north,south,south,take_cabbage(T9)) )
        & ! [T8] :
            ( p(south,north,south,south,T8)
           => p(north,north,south,north,take_cabbage(T8)) )
        & ! [X1,Y1,V] :
            ( p(north,X1,north,Y1,V)
           => p(south,X1,south,Y1,take_goat(V)) )
        & ! [X,Y,U] :
            ( p(south,X,south,Y,U)
           => p(north,X,north,Y,take_goat(U)) )
        & ! [T7] :
            ( p(north,north,north,south,T7)
           => p(south,south,north,south,take_wolf(T7)) )
        & ! [T6] :
            ( p(south,south,north,south,T6)
           => p(north,north,north,south,take_wolf(T6)) )
        & ! [T5] :
            ( p(north,north,south,north,T5)
           => p(south,south,south,north,take_wolf(T5)) )
        & ! [T4] :
            ( p(south,south,south,north,T4)
           => p(north,north,south,north,take_wolf(T4)) )
        & ! [T3] :
            ( p(north,south,north,south,T3)
           => p(south,south,north,south,go_alone(T3)) )
        & ! [T2] :
            ( p(south,south,north,south,T2)
           => p(north,south,north,south,go_alone(T2)) )
        & ! [T1] :
            ( p(north,north,south,north,T1)
           => p(south,north,south,north,go_alone(T1)) )
        & ! [T] :
            ( p(south,north,south,north,T)
           => p(north,north,south,north,go_alone(T)) )
        & p(south,south,south,south,start) )
     => ? [Z] : p(north,north,north,north,Z) ),
    inference(negated_conjecture,[status(cth)],[f1]) ).

fof(f3,plain,
    ( ! [Z] : ~ p(north,north,north,north,Z)
    & ! [V1] :
        ( p(south,south,north,south,take_cabbage(V1))
        | ~ p(north,south,north,north,V1) )
    & ! [U1] :
        ( p(north,south,north,north,take_cabbage(U1))
        | ~ p(south,south,north,south,U1) )
    & ! [T9] :
        ( p(south,north,south,south,take_cabbage(T9))
        | ~ p(north,north,south,north,T9) )
    & ! [T8] :
        ( p(north,north,south,north,take_cabbage(T8))
        | ~ p(south,north,south,south,T8) )
    & ! [X1,Y1,V] :
        ( p(south,X1,south,Y1,take_goat(V))
        | ~ p(north,X1,north,Y1,V) )
    & ! [X,Y,U] :
        ( p(north,X,north,Y,take_goat(U))
        | ~ p(south,X,south,Y,U) )
    & ! [T7] :
        ( p(south,south,north,south,take_wolf(T7))
        | ~ p(north,north,north,south,T7) )
    & ! [T6] :
        ( p(north,north,north,south,take_wolf(T6))
        | ~ p(south,south,north,south,T6) )
    & ! [T5] :
        ( p(south,south,south,north,take_wolf(T5))
        | ~ p(north,north,south,north,T5) )
    & ! [T4] :
        ( p(north,north,south,north,take_wolf(T4))
        | ~ p(south,south,south,north,T4) )
    & ! [T3] :
        ( p(south,south,north,south,go_alone(T3))
        | ~ p(north,south,north,south,T3) )
    & ! [T2] :
        ( p(north,south,north,south,go_alone(T2))
        | ~ p(south,south,north,south,T2) )
    & ! [T1] :
        ( p(south,north,south,north,go_alone(T1))
        | ~ p(north,north,south,north,T1) )
    & ! [T] :
        ( p(north,north,south,north,go_alone(T))
        | ~ p(south,north,south,north,T) )
    & p(south,south,south,south,start) ),
    inference(pre_NNF_transformation,[status(thm)],[f2]) ).

fof(f4,plain,
    p(south,south,south,south,start),
    inference(cnf_transformation,[status(thm)],[f3]) ).

fof(f6,plain,
    ! [X0] :
      ( p(south,north,south,north,go_alone(X0))
      | ~ p(north,north,south,north,X0) ),
    inference(cnf_transformation,[status(thm)],[f3]) ).

fof(f8,plain,
    ! [X0] :
      ( p(south,south,north,south,go_alone(X0))
      | ~ p(north,south,north,south,X0) ),
    inference(cnf_transformation,[status(thm)],[f3]) ).

fof(f11,plain,
    ! [X0] :
      ( p(north,north,north,south,take_wolf(X0))
      | ~ p(south,south,north,south,X0) ),
    inference(cnf_transformation,[status(thm)],[f3]) ).

fof(f13,plain,
    ! [X0,X1,X2] :
      ( p(north,X0,north,X1,take_goat(X2))
      | ~ p(south,X0,south,X1,X2) ),
    inference(cnf_transformation,[status(thm)],[f3]) ).

fof(f14,plain,
    ! [X0,X1,X2] :
      ( p(south,X0,south,X1,take_goat(X2))
      | ~ p(north,X0,north,X1,X2) ),
    inference(cnf_transformation,[status(thm)],[f3]) ).

fof(f15,plain,
    ! [X0] :
      ( p(north,north,south,north,take_cabbage(X0))
      | ~ p(south,north,south,south,X0) ),
    inference(cnf_transformation,[status(thm)],[f3]) ).

fof(f19,plain,
    ! [X0] : ~ p(north,north,north,north,X0),
    inference(cnf_transformation,[status(thm)],[f3]) ).

fof(f20,plain,
    ! [X0] : ~ p(south,north,south,north,X0),
    inference(resolution,[status(thm)],[f13,f19]) ).

fof(f22,plain,
    ! [X0] : ~ p(north,north,south,north,X0),
    inference(forward_subsumption_resolution,[status(thm)],[f6,f20]) ).

fof(f26,plain,
    ! [X0] : ~ p(south,north,south,south,X0),
    inference(forward_subsumption_resolution,[status(thm)],[f15,f22]) ).

fof(f27,plain,
    ! [X0] : ~ p(north,north,north,south,X0),
    inference(resolution,[status(thm)],[f26,f14]) ).

fof(f28,plain,
    ! [X0] : ~ p(south,south,north,south,X0),
    inference(backward_subsumption_resolution,[status(thm)],[f11,f27]) ).

fof(f30,plain,
    ! [X0] : ~ p(north,south,north,south,X0),
    inference(backward_subsumption_resolution,[status(thm)],[f8,f28]) ).

fof(f31,plain,
    ! [X0] : ~ p(south,south,south,south,X0),
    inference(resolution,[status(thm)],[f30,f13]) ).

fof(f33,plain,
    $false,
    inference(backward_subsumption_resolution,[status(thm)],[f4,f31]) ).

%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.00/0.05  % Problem  : PUZ047+1 : TPTP v9.3.1. Released v2.5.0.
% 0.00/0.07  % Command  : drodi -timeout(300) /export/starexec/sandbox/benchmark/theBenchmark.p
% 0.19/5.51  % Computer : n001.cluster.edu
% 0.19/5.51  % Model    : x86_64 x86_64
% 0.19/5.51  % CPU      : Intel(R) Xeon(R) CPU E5-2620 v4 @ 2.10GHz
% 0.19/5.51  % Memory   : 8046.5625MB
% 0.19/5.51  % OS       : Linux 6.8.0-71-generic
% 0.19/5.51  % CPULimit : 300
% 0.19/5.51  % WCLimit  : 300
% 0.19/5.51  % DateTime : Mon Sep 21 03:52:33 UTC 2026
% 0.19/5.51  % CPUTime  : 
% 0.19/5.52  % Drodi V4.1.1
% 0.19/5.53  % Refutation found
% 0.19/5.53  % SZS status Theorem for theBenchmark: Theorem is valid
% 0.19/5.53  % SZS output start CNFRefutation for theBenchmark
% See solution above
% 0.24/5.60  % Elapsed time: 0.082334 seconds
% 0.24/5.60  % CPU time: 0.091312 seconds
% 0.24/5.60  % Total memory used: 1.759 MB
% 0.24/5.60  % Net memory used: 1.756 MB
%------------------------------------------------------------------------------