↑ Up

Vampire-SAT---5.0.1.THM-Ref.s

View TPTP
Problem
Process solution in
SystemOnTSTP
Download .tgz
%------------------------------------------------------------------------------
% File     : Vampire-SAT---5.0.1
% Problem  : PUZ061+1 : TPTP v9.3.1. Released v3.1.0.
% Transfm  : none
% Format   : tptp:raw
% Command  : run_vampire /export/starexec/sandbox2/benchmark/theBenchmark.p 300 SAT

% 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 : Tue Sep 29 12:32:07 PM UTC 2026

% Result   : Theorem 0.22s 0.55s
% Output   : Refutation 0.22s
% Verified : 
% SZS Type : Refutation
%            Derivation depth      :    9
%            Number of leaves      :    1
% Syntax   : Number of formulae    :   16 (   6 unt;   0 def)
%            Number of atoms       :  103 (   0 equ)
%            Maximal formula atoms :   17 (   6 avg)
%            Number of connectives :  115 (  28   ~;  21   |;  48   &)
%                                         (   0 <=>;  18  =>;   0  <=;   0 <~>)
%            Maximal formula depth :   21 (   9 avg)
%            Maximal term depth    :    1 (   1 avg)
%            Number of predicates  :    6 (   5 usr;   1 prp; 0-2 aty)
%            Number of functors    :    3 (   3 usr;   3 con; 0-0 aty)
%            Number of variables   :   78 (  63   !;  15   ?)

% Comments : 
%------------------------------------------------------------------------------
fof(f1,conjecture,
    ! [X0,X1,X2,X3,X4,X5] :
      ( ( ! [X6,X7] :
            ( ( alive(X7)
              & eats(X7,X5) )
           => likes(X7,X6) )
        & ! [X6] :
            ( food(X6)
           => likes(X1,X6) )
        & food(X4)
        & food(X5)
        & ! [X6] :
            ( ? [X7] :
                ( eats(X7,X6)
                & not_killed_by(X7,X6) )
           => food(X6) )
        & eats(X2,X0)
        & alive(X2)
        & ! [X6] :
            ( eats(X2,X6)
           => eats(X3,X6) )
        & ! [X7] :
            ( alive(X7)
           => ! [X6] : not_killed_by(X7,X6) ) )
     => likes(X1,X0) ),
    file('/export/starexec/sandbox2/benchmark/theBenchmark.p',prove_this) ).

fof(f2,negated_conjecture,
    ~ ! [X0,X1,X2,X3,X4,X5] :
        ( ( ! [X6,X7] :
              ( ( alive(X7)
                & eats(X7,X5) )
             => likes(X7,X6) )
          & ! [X6] :
              ( food(X6)
             => likes(X1,X6) )
          & food(X4)
          & food(X5)
          & ! [X6] :
              ( ? [X7] :
                  ( eats(X7,X6)
                  & not_killed_by(X7,X6) )
             => food(X6) )
          & eats(X2,X0)
          & alive(X2)
          & ! [X6] :
              ( eats(X2,X6)
             => eats(X3,X6) )
          & ! [X7] :
              ( alive(X7)
             => ! [X6] : not_killed_by(X7,X6) ) )
       => likes(X1,X0) ),
    inference(negated_conjecture,[status(cth)],[f1]) ).

fof(f3,plain,
    ~ ! [X0,X1,X2,X3,X4,X5] :
        ( ( ! [X6,X7] :
              ( ( alive(X7)
                & eats(X7,X5) )
             => likes(X7,X6) )
          & ! [X8] :
              ( food(X8)
             => likes(X1,X8) )
          & food(X4)
          & food(X5)
          & ! [X9] :
              ( ? [X10] :
                  ( eats(X10,X9)
                  & not_killed_by(X10,X9) )
             => food(X9) )
          & eats(X2,X0)
          & alive(X2)
          & ! [X11] :
              ( eats(X2,X11)
             => eats(X3,X11) )
          & ! [X12] :
              ( alive(X12)
             => ! [X13] : not_killed_by(X12,X13) ) )
       => likes(X1,X0) ),
    inference(rectify,[],[f2]) ).

fof(f4,plain,
    ? [X0,X1,X2,X3,X4,X5] :
      ( ~ likes(X1,X0)
      & ! [X6,X7] :
          ( likes(X7,X6)
          | ~ alive(X7)
          | ~ eats(X7,X5) )
      & ! [X8] :
          ( likes(X1,X8)
          | ~ food(X8) )
      & food(X4)
      & food(X5)
      & ! [X9] :
          ( food(X9)
          | ! [X10] :
              ( ~ eats(X10,X9)
              | ~ not_killed_by(X10,X9) ) )
      & eats(X2,X0)
      & alive(X2)
      & ! [X11] :
          ( eats(X3,X11)
          | ~ eats(X2,X11) )
      & ! [X12] :
          ( ! [X13] : not_killed_by(X12,X13)
          | ~ alive(X12) ) ),
    inference(ennf_transformation,[],[f3]) ).

fof(f5,plain,
    ? [X0,X1,X2,X3,X4,X5] :
      ( ~ likes(X1,X0)
      & ! [X6,X7] :
          ( likes(X7,X6)
          | ~ alive(X7)
          | ~ eats(X7,X5) )
      & ! [X8] :
          ( likes(X1,X8)
          | ~ food(X8) )
      & food(X4)
      & food(X5)
      & ! [X9] :
          ( food(X9)
          | ! [X10] :
              ( ~ eats(X10,X9)
              | ~ not_killed_by(X10,X9) ) )
      & eats(X2,X0)
      & alive(X2)
      & ! [X11] :
          ( eats(X3,X11)
          | ~ eats(X2,X11) )
      & ! [X12] :
          ( ! [X13] : not_killed_by(X12,X13)
          | ~ alive(X12) ) ),
    inference(flattening,[],[f4]) ).

fof(f6,plain,
    ! [X10,X9] :
      ( ~ not_killed_by(X10,X9)
      | ~ eats(X10,X9)
      | food(X9) ),
    inference(cnf_transformation,[],[f5]) ).

fof(f8,plain,
    ! [X8] :
      ( likes(sK1,X8)
      | ~ food(X8) ),
    inference(cnf_transformation,[],[f5]) ).

fof(f10,plain,
    ! [X12,X13] :
      ( not_killed_by(X12,X13)
      | ~ alive(X12) ),
    inference(cnf_transformation,[],[f5]) ).

fof(f11,plain,
    alive(sK2),
    inference(cnf_transformation,[],[f5]) ).

fof(f12,plain,
    eats(sK2,sK0),
    inference(cnf_transformation,[],[f5]) ).

fof(f15,plain,
    ~ likes(sK1,sK0),
    inference(cnf_transformation,[],[f5]) ).

fof(f16,plain,
    ~ food(sK0),
    inference(resolution,[],[f8,f15]) ).

fof(f17,plain,
    ! [X0,X1] :
      ( ~ alive(X0)
      | food(X1)
      | ~ eats(X0,X1) ),
    inference(resolution,[],[f6,f10]) ).

fof(f18,plain,
    ! [X0] :
      ( food(X0)
      | ~ eats(sK2,X0) ),
    inference(resolution,[],[f17,f11]) ).

fof(f29,plain,
    ~ eats(sK2,sK0),
    inference(resolution,[],[f18,f16]) ).

fof(f30,plain,
    $false,
    inference(forward_subsumption_resolution,[],[f29,f12]) ).

%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.00/0.04  % Problem  : PUZ061+1 : TPTP v9.3.1. Released v3.1.0.
% 0.00/0.08  % Command  : run_vampire /export/starexec/sandbox2/benchmark/theBenchmark.p 300 SAT
% 0.18/0.45  % Computer : n010.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 : Sun Sep 27 22:38:32 UTC 2026
% 0.18/0.45  % CPUTime  : 
% 0.18/0.45  Running run_vampire /export/starexec/sandbox2/benchmark/theBenchmark.p 300 SAT
% 0.22/0.50  Running first-order model finding
% 0.22/0.51  Running: /export/starexec/sandbox2/solver/bin/vampire-ho --input_syntax tptp --output_axiom_names on --mode casc --intent sat -m 16384 --cores 7 -t 300 /export/starexec/sandbox2/benchmark/theBenchmark.p
% 0.22/0.55  % (1374590)Will run a generic schedule for satisfiability detection.
% 0.22/0.55  % (1374599)ott+31_1_sil=16000:lcm=predicate:bce=on:newcnf=on:random_seed=1191633250:i=116_2999 on theBenchmark for (2999ds/116Mi)
% 0.22/0.55  % (1374599) found proof, printing to "/export/starexec/sandbox2/tmp/vampire-proof-1374590-1374599"...
% 0.22/0.55  % (1374599)...printing done.
% 0.22/0.55  % (1374599)Refutation found. Thanks to Tanya!
% 0.22/0.55  % SZS status Theorem for theBenchmark
% 0.22/0.55  % SZS output start Proof for theBenchmark
% See solution above
% 0.22/0.55  % (1374599)------------------------------
% 0.22/0.55  % (1374599)Version: Vampire 5.0.1 (Release build, commit 5ef7c2677 on 2026-07-16 16:54:09 +0200)
% 0.22/0.55  % (1374599)Linked with Z3 4.14.0.0 3c47fd96cf5645d0c42b2c819d9e9a84380aa721 z3-4.8.4-9178-g3c47fd96c
% 0.22/0.55  % (1374599)CaDiCaL version: 2.1.3
% 0.22/0.55  % (1374599)Termination reason: Refutation
% 0.22/0.55  % (1374599)Time elapsed: 0.002 s
% 0.22/0.55  % (1374599)Peak memory usage: 11 MB
% 0.22/0.55  % (1374599)Instructions burned: 1 (million)
% 0.22/0.55  % (1374590)Success in time 0.036 s
% 0.22/0.55  % Vampire exiting
%------------------------------------------------------------------------------