↑ Up

Drodi---4.1.1.THM-CRf.s

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

% Computer : n004.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 02:00:00 PM UTC 2026

% Result   : Theorem 0.18s 0.49s
% Output   : CNFRefutation 0.18s
% Verified : 
% SZS Type : Refutation
%            Derivation depth      :    9
%            Number of leaves      :    1
% Syntax   : Number of formulae    :   16 (   6 unt;   0 def)
%            Number of atoms       :   88 (   0 equ)
%            Maximal formula atoms :   14 (   5 avg)
%            Number of connectives :  100 (  28   ~;  22   |;  40   &)
%                                         (   0 <=>;  10  =>;   0  <=;   0 <~>)
%            Maximal formula depth :   19 (   7 avg)
%            Maximal term depth    :    1 (   1 avg)
%            Number of predicates  :    6 (   5 usr;   1 prp; 0-2 aty)
%            Number of functors    :    6 (   6 usr;   6 con; 0-0 aty)
%            Number of variables   :   62 (  48   !;  14   ?)

% Comments : 
%------------------------------------------------------------------------------
fof(f1,conjecture,
    ! [Peanuts,John,Bill,Sue,Apples,Chicken] :
      ( ( ! [Y] :
            ( alive(Y)
           => ! [X] : not_killed_by(Y,X) )
        & ! [X] :
            ( eats(Bill,X)
           => eats(Sue,X) )
        & alive(Bill)
        & eats(Bill,Peanuts)
        & ! [X] :
            ( ? [Y] :
                ( not_killed_by(Y,X)
                & eats(Y,X) )
           => food(X) )
        & food(Chicken)
        & food(Apples)
        & ! [X] :
            ( food(X)
           => likes(John,X) ) )
     => likes(John,Peanuts) ),
    file('/export/starexec/sandbox2/benchmark/theBenchmark.p') ).

fof(f2,negated_conjecture,
    ~ ! [Peanuts,John,Bill,Sue,Apples,Chicken] :
        ( ( ! [Y] :
              ( alive(Y)
             => ! [X] : not_killed_by(Y,X) )
          & ! [X] :
              ( eats(Bill,X)
             => eats(Sue,X) )
          & alive(Bill)
          & eats(Bill,Peanuts)
          & ! [X] :
              ( ? [Y] :
                  ( not_killed_by(Y,X)
                  & eats(Y,X) )
             => food(X) )
          & food(Chicken)
          & food(Apples)
          & ! [X] :
              ( food(X)
             => likes(John,X) ) )
       => likes(John,Peanuts) ),
    inference(negated_conjecture,[status(cth)],[f1]) ).

fof(f3,plain,
    ? [Peanuts,John,Bill,Sue,Apples,Chicken] :
      ( ~ likes(John,Peanuts)
      & ! [Y] :
          ( ! [X] : not_killed_by(Y,X)
          | ~ alive(Y) )
      & ! [X] :
          ( eats(Sue,X)
          | ~ eats(Bill,X) )
      & alive(Bill)
      & eats(Bill,Peanuts)
      & ! [X] :
          ( food(X)
          | ! [Y] :
              ( ~ not_killed_by(Y,X)
              | ~ eats(Y,X) ) )
      & food(Chicken)
      & food(Apples)
      & ! [X] :
          ( likes(John,X)
          | ~ food(X) ) ),
    inference(pre_NNF_transformation,[status(thm)],[f2]) ).

fof(f4,plain,
    ? [Peanuts,John] :
      ( ~ likes(John,Peanuts)
      & ! [Y] :
          ( ! [X] : not_killed_by(Y,X)
          | ~ alive(Y) )
      & ? [Bill] :
          ( ? [Sue] :
            ! [X] :
              ( eats(Sue,X)
              | ~ eats(Bill,X) )
          & alive(Bill)
          & eats(Bill,Peanuts)
          & ! [X] :
              ( food(X)
              | ! [Y] :
                  ( ~ not_killed_by(Y,X)
                  | ~ eats(Y,X) ) )
          & ? [Chicken] : food(Chicken)
          & ? [Apples] : food(Apples)
          & ! [X] :
              ( likes(John,X)
              | ~ food(X) ) ) ),
    inference(miniscoping,[status(thm)],[f3]) ).

fof(f5,plain,
    ( ~ likes(sK1_skl,sK0_skl)
    & ! [Y] :
        ( ! [X] : not_killed_by(Y,X)
        | ~ alive(Y) )
    & ! [X] :
        ( eats(sK5_skl,X)
        | ~ eats(sK2_skl,X) )
    & alive(sK2_skl)
    & eats(sK2_skl,sK0_skl)
    & ! [X] :
        ( food(X)
        | ! [Y] :
            ( ~ not_killed_by(Y,X)
            | ~ eats(Y,X) ) )
    & food(sK4_skl)
    & food(sK3_skl)
    & ! [X] :
        ( likes(sK1_skl,X)
        | ~ food(X) ) ),
    inference(skolemize,[status(esa),new_symbols(skolem,[sK0_skl,sK1_skl,sK2_skl,sK3_skl,sK4_skl,sK5_skl]),skolemize(Peanuts,sK0_skl),skolemize(John,sK1_skl),skolemize(Bill,sK2_skl),skolemize(Apples,sK3_skl),skolemize(Chicken,sK4_skl),skolemize(Sue,sK5_skl)],[f4]) ).

fof(f6,plain,
    ! [X0] :
      ( likes(sK1_skl,X0)
      | ~ food(X0) ),
    inference(cnf_transformation,[status(thm)],[f5]) ).

fof(f9,plain,
    ! [X0,X1] :
      ( food(X1)
      | ~ not_killed_by(X0,X1)
      | ~ eats(X0,X1) ),
    inference(cnf_transformation,[status(thm)],[f5]) ).

fof(f10,plain,
    eats(sK2_skl,sK0_skl),
    inference(cnf_transformation,[status(thm)],[f5]) ).

fof(f11,plain,
    alive(sK2_skl),
    inference(cnf_transformation,[status(thm)],[f5]) ).

fof(f13,plain,
    ! [X0,X1] :
      ( not_killed_by(X0,X1)
      | ~ alive(X0) ),
    inference(cnf_transformation,[status(thm)],[f5]) ).

fof(f14,plain,
    ~ likes(sK1_skl,sK0_skl),
    inference(cnf_transformation,[status(thm)],[f5]) ).

fof(f15,plain,
    ~ food(sK0_skl),
    inference(resolution,[status(thm)],[f14,f6]) ).

fof(f16,plain,
    ! [X0,X1] :
      ( ~ alive(X0)
      | food(X1)
      | ~ eats(X0,X1) ),
    inference(resolution,[status(thm)],[f9,f13]) ).

fof(f17,plain,
    ! [X0] :
      ( food(X0)
      | ~ eats(sK2_skl,X0) ),
    inference(resolution,[status(thm)],[f16,f11]) ).

fof(f18,plain,
    food(sK0_skl),
    inference(resolution,[status(thm)],[f17,f10]) ).

fof(f19,plain,
    $false,
    inference(forward_subsumption_resolution,[status(thm)],[f18,f15]) ).

%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.00/0.05  % Problem  : PUZ060+1 : TPTP v9.3.1. Released v3.1.0.
% 0.00/0.06  % Command  : drodi -timeout(300) /export/starexec/sandbox2/benchmark/theBenchmark.p
% 0.18/0.45  % Computer : n004.cluster.edu
% 0.18/0.45  % Model    : x86_64 x86_64
% 0.18/0.45  % CPU      : Intel(R) Xeon(R) CPU E5-2620 v4 @ 2.10GHz
% 0.18/0.45  % Memory   : 8046.5625MB
% 0.18/0.45  % OS       : Linux 6.8.0-71-generic
% 0.18/0.45  % CPULimit : 300
% 0.18/0.45  % WCLimit  : 300
% 0.18/0.45  % DateTime : Mon Sep 21 03:48:19 UTC 2026
% 0.18/0.45  % CPUTime  : 
% 0.18/0.48  % Drodi V4.1.1
% 0.18/0.49  % Refutation found
% 0.18/0.49  % SZS status Theorem for theBenchmark: Theorem is valid
% 0.18/0.49  % SZS output start CNFRefutation for theBenchmark
% See solution above
% 0.18/0.54  % Elapsed time: 0.075155 seconds
% 0.18/0.54  % CPU time: 0.085790 seconds
% 0.18/0.54  % Total memory used: 1.736 MB
% 0.18/0.54  % Net memory used: 1.731 MB
%------------------------------------------------------------------------------