↑ 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  : SYN729+1 : TPTP v9.3.1. Released v2.5.0.
% Transfm  : none
% Format   : tptp:raw
% Command  : run_vampire /export/starexec/sandbox/benchmark/theBenchmark.p 300 SAT

% Computer : n015.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 02:18:09 PM UTC 2026

% Result   : Theorem 0.08s 0.27s
% Output   : Refutation 0.08s
% Verified : 
% SZS Type : Refutation
%            Derivation depth      :   13
%            Number of leaves      :    1
% Syntax   : Number of formulae    :   19 (   6 unt;   0 def)
%            Number of atoms       :   81 (   0 equ)
%            Maximal formula atoms :    9 (   4 avg)
%            Number of connectives :   92 (  30   ~;  18   |;  32   &)
%                                         (   0 <=>;  12  =>;   0  <=;   0 <~>)
%            Maximal formula depth :    8 (   5 avg)
%            Maximal term depth    :    4 (   1 avg)
%            Number of predicates  :    3 (   2 usr;   1 prp; 0-2 aty)
%            Number of functors    :    4 (   4 usr;   1 con; 0-1 aty)
%            Number of variables   :   38 (  26   !;  12   ?)

% Comments : 
%------------------------------------------------------------------------------
fof(f1,conjecture,
    ( ( ! [X0] :
        ? [X1] :
          ( p(X0)
         => ( l(X0,g(h(X1)))
            & p(X1) ) )
      & ! [X2] :
          ( p(X2)
         => ( p(g(X2))
            & p(h(X2)) ) ) )
   => ! [X0] :
        ( p(X0)
       => ? [X1] :
            ( l(X0,X1)
            & p(X1) ) ) ),
    file('/export/starexec/sandbox/benchmark/theBenchmark.p',thm72) ).

fof(f2,negated_conjecture,
    ~ ( ( ! [X0] :
          ? [X1] :
            ( p(X0)
           => ( l(X0,g(h(X1)))
              & p(X1) ) )
        & ! [X2] :
            ( p(X2)
           => ( p(g(X2))
              & p(h(X2)) ) ) )
     => ! [X0] :
          ( p(X0)
         => ? [X1] :
              ( l(X0,X1)
              & p(X1) ) ) ),
    inference(negated_conjecture,[status(cth)],[f1]) ).

fof(f3,plain,
    ~ ( ( ! [X0] :
          ? [X1] :
            ( p(X0)
           => ( l(X0,g(h(X1)))
              & p(X1) ) )
        & ! [X2] :
            ( p(X2)
           => ( p(g(X2))
              & p(h(X2)) ) ) )
     => ! [X3] :
          ( p(X3)
         => ? [X4] :
              ( l(X3,X4)
              & p(X4) ) ) ),
    inference(rectify,[],[f2]) ).

fof(f4,plain,
    ( ? [X3] :
        ( ! [X4] :
            ( ~ l(X3,X4)
            | ~ p(X4) )
        & p(X3) )
    & ! [X0] :
      ? [X1] :
        ( ( l(X0,g(h(X1)))
          & p(X1) )
        | ~ p(X0) )
    & ! [X2] :
        ( ( p(g(X2))
          & p(h(X2)) )
        | ~ p(X2) ) ),
    inference(ennf_transformation,[],[f3]) ).

fof(f5,plain,
    ( ? [X3] :
        ( ! [X4] :
            ( ~ l(X3,X4)
            | ~ p(X4) )
        & p(X3) )
    & ! [X0] :
      ? [X1] :
        ( ( l(X0,g(h(X1)))
          & p(X1) )
        | ~ p(X0) )
    & ! [X2] :
        ( ( p(g(X2))
          & p(h(X2)) )
        | ~ p(X2) ) ),
    inference(flattening,[],[f4]) ).

fof(f6,plain,
    ( ? [X0] :
        ( ! [X1] :
            ( ~ l(X0,X1)
            | ~ p(X1) )
        & p(X0) )
    & ! [X2] :
      ? [X3] :
        ( ( l(X2,g(h(X3)))
          & p(X3) )
        | ~ p(X2) )
    & ! [X4] :
        ( ( p(g(X4))
          & p(h(X4)) )
        | ~ p(X4) ) ),
    inference(rectify,[],[f5]) ).

fof(f7,plain,
    ( ! [X1] :
        ( ~ l(sK0,X1)
        | ~ p(X1) )
    & p(sK0)
    & ! [X2] :
        ( ( l(X2,g(h(sK1(X2))))
          & p(sK1(X2)) )
        | ~ p(X2) )
    & ! [X4] :
        ( ( p(g(X4))
          & p(h(X4)) )
        | ~ p(X4) ) ),
    inference(skolemize,[status(esa),new_symbols(skolem,[sK0,sK1]),skolemize(X0,sK0),skolemize(X3,sK1(X2))],[f6]) ).

fof(f8,plain,
    ! [X4] :
      ( p(h(X4))
      | ~ p(X4) ),
    inference(cnf_transformation,[],[f7]) ).

fof(f9,plain,
    ! [X4] :
      ( p(g(X4))
      | ~ p(X4) ),
    inference(cnf_transformation,[],[f7]) ).

fof(f10,plain,
    ! [X2] :
      ( p(sK1(X2))
      | ~ p(X2) ),
    inference(cnf_transformation,[],[f7]) ).

fof(f11,plain,
    ! [X2] :
      ( l(X2,g(h(sK1(X2))))
      | ~ p(X2) ),
    inference(cnf_transformation,[],[f7]) ).

fof(f12,plain,
    p(sK0),
    inference(cnf_transformation,[],[f7]) ).

fof(f13,plain,
    ! [X1] :
      ( ~ l(sK0,X1)
      | ~ p(X1) ),
    inference(cnf_transformation,[],[f7]) ).

fof(f14,plain,
    ( ~ p(sK0)
    | ~ p(g(h(sK1(sK0)))) ),
    inference(resolution,[],[f11,f13]) ).

fof(f15,plain,
    ~ p(g(h(sK1(sK0)))),
    inference(forward_subsumption_resolution,[],[f14,f12]) ).

fof(f16,plain,
    ~ p(h(sK1(sK0))),
    inference(resolution,[],[f15,f9]) ).

fof(f17,plain,
    ~ p(sK1(sK0)),
    inference(resolution,[],[f16,f8]) ).

fof(f18,plain,
    ~ p(sK0),
    inference(resolution,[],[f17,f10]) ).

fof(f19,plain,
    $false,
    inference(forward_subsumption_resolution,[],[f18,f12]) ).

%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.00/0.03  % Problem  : SYN729+1 : TPTP v9.3.1. Released v2.5.0.
% 0.00/0.05  % Command  : run_vampire /export/starexec/sandbox/benchmark/theBenchmark.p 300 SAT
% 0.08/0.19  % Computer : n015.cluster.edu
% 0.08/0.19  % Model    : x86_64 x86_64
% 0.08/0.19  % CPU      : Intel(R) Xeon(R) CPU E5-2620 v4 @ 2.10GHz
% 0.08/0.19  % Memory   : 8046.5625MB
% 0.08/0.19  % OS       : Linux 6.8.0-71-generic
% 0.08/0.19  % CPULimit : 300
% 0.08/0.19  % WCLimit  : 300
% 0.08/0.19  % DateTime : Mon Sep 28 16:53:02 UTC 2026
% 0.08/0.20  % CPUTime  : 
% 0.08/0.20  Running run_vampire /export/starexec/sandbox/benchmark/theBenchmark.p 300 SAT
% 0.08/0.23  Running first-order model finding
% 0.08/0.23  Running: /export/starexec/sandbox/solver/bin/vampire-ho --input_syntax tptp --output_axiom_names on --mode casc --intent sat -m 16384 --cores 7 -t 300 /export/starexec/sandbox/benchmark/theBenchmark.p
% 0.08/0.27  % (2772754)Will run a generic schedule for satisfiability detection.
% 0.08/0.27  % (2772766)dis+10_1_sil=32000:sp=arity:random_seed=1866551904:i=103:fgj=on_2999 on theBenchmark for (2999ds/103Mi)
% 0.08/0.27  % (2772766) found proof, printing to "/export/starexec/sandbox/tmp/vampire-proof-2772754-2772766"...
% 0.08/0.27  % (2772766)...printing done.
% 0.08/0.27  % (2772766)Refutation found. Thanks to Tanya!
% 0.08/0.27  % SZS status Theorem for theBenchmark
% 0.08/0.27  % SZS output start Proof for theBenchmark
% See solution above
% 0.08/0.27  % (2772766)------------------------------
% 0.08/0.27  % (2772766)Version: Vampire 5.0.1 (Release build, commit 5ef7c2677 on 2026-07-16 16:54:09 +0200)
% 0.08/0.27  % (2772766)Linked with Z3 4.14.0.0 3c47fd96cf5645d0c42b2c819d9e9a84380aa721 z3-4.8.4-9178-g3c47fd96c
% 0.08/0.27  % (2772766)CaDiCaL version: 2.1.3
% 0.08/0.27  % (2772766)Termination reason: Refutation
% 0.08/0.27  % (2772766)Time elapsed: 0.001 s
% 0.08/0.27  % (2772766)Peak memory usage: 11 MB
% 0.08/0.27  % (2772766)Instructions burned: 1 (million)
% 0.08/0.27  % (2772754)Success in time 0.031 s
% 0.08/0.27  % Vampire exiting
%------------------------------------------------------------------------------