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

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

% Result   : Theorem 0.21s 0.27s
% Output   : Refutation 0.21s
% Verified : 
% SZS Type : Refutation
%            Derivation depth      :   11
%            Number of leaves      :    1
% Syntax   : Number of formulae    :   17 (   6 unt;   0 def)
%            Number of atoms       :   63 (   0 equ)
%            Maximal formula atoms :    9 (   3 avg)
%            Number of connectives :   68 (  22   ~;  12   |;  22   &)
%                                         (   0 <=>;  12  =>;   0  <=;   0 <~>)
%            Maximal formula depth :    8 (   4 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   :   30 (  20   !;  10   ?)

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

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

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

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

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

fof(f6,plain,
    ! [X4] :
      ( ~ big_r(sK0,X4)
      | ~ big_p(X4) ),
    inference(cnf_transformation,[],[f5]) ).

fof(f7,plain,
    ! [X0] :
      ( big_p(sK1(X0))
      | ~ big_p(X0) ),
    inference(cnf_transformation,[],[f5]) ).

fof(f8,plain,
    ! [X0] :
      ( big_r(X0,g(h(sK1(X0))))
      | ~ big_p(X0) ),
    inference(cnf_transformation,[],[f5]) ).

fof(f9,plain,
    ! [X2] :
      ( big_p(h(X2))
      | ~ big_p(X2) ),
    inference(cnf_transformation,[],[f5]) ).

fof(f10,plain,
    ! [X2] :
      ( big_p(g(X2))
      | ~ big_p(X2) ),
    inference(cnf_transformation,[],[f5]) ).

fof(f11,plain,
    big_p(sK0),
    inference(cnf_transformation,[],[f5]) ).

fof(f12,plain,
    ( ~ big_p(sK0)
    | ~ big_p(g(h(sK1(sK0)))) ),
    inference(resolution,[],[f8,f6]) ).

fof(f13,plain,
    ~ big_p(g(h(sK1(sK0)))),
    inference(forward_subsumption_resolution,[],[f12,f11]) ).

fof(f14,plain,
    ~ big_p(h(sK1(sK0))),
    inference(resolution,[],[f13,f10]) ).

fof(f15,plain,
    ~ big_p(sK1(sK0)),
    inference(resolution,[],[f14,f9]) ).

fof(f16,plain,
    ~ big_p(sK0),
    inference(resolution,[],[f15,f7]) ).

fof(f17,plain,
    $false,
    inference(forward_subsumption_resolution,[],[f16,f11]) ).

%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.00/0.03  % Problem  : SYN365+1 : TPTP v9.3.1. Released v2.0.0.
% 0.00/0.06  % Command  : run_vampire /export/starexec/sandbox/benchmark/theBenchmark.p 300 SAT
% 0.08/0.20  % Computer : n001.cluster.edu
% 0.08/0.20  % Model    : x86_64 x86_64
% 0.08/0.20  % CPU      : Intel(R) Xeon(R) CPU E5-2620 v4 @ 2.10GHz
% 0.08/0.20  % Memory   : 8046.5625MB
% 0.08/0.20  % OS       : Linux 6.8.0-71-generic
% 0.08/0.20  % CPULimit : 300
% 0.08/0.20  % WCLimit  : 300
% 0.08/0.20  % DateTime : Mon Sep 28 15:54:48 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.24  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.21/0.27  % (454073)Will run a generic schedule for satisfiability detection.
% 0.21/0.27  % (454086)ott+31_1_sil=16000:lcm=predicate:bce=on:newcnf=on:random_seed=2134719084:i=116_2999 on theBenchmark for (2999ds/116Mi)
% 0.21/0.27  % (454086) found proof, printing to "/export/starexec/sandbox/tmp/vampire-proof-454073-454086"...
% 0.21/0.27  % (454086)...printing done.
% 0.21/0.27  % (454086)Refutation found. Thanks to Tanya!
% 0.21/0.27  % SZS status Theorem for theBenchmark
% 0.21/0.27  % SZS output start Proof for theBenchmark
% See solution above
% 0.21/0.27  % (454086)------------------------------
% 0.21/0.27  % (454086)Version: Vampire 5.0.1 (Release build, commit 5ef7c2677 on 2026-07-16 16:54:09 +0200)
% 0.21/0.27  % (454086)Linked with Z3 4.14.0.0 3c47fd96cf5645d0c42b2c819d9e9a84380aa721 z3-4.8.4-9178-g3c47fd96c
% 0.21/0.27  % (454086)CaDiCaL version: 2.1.3
% 0.21/0.27  % (454086)Termination reason: Refutation
% 0.21/0.27  % (454086)Time elapsed: 0.001 s
% 0.21/0.27  % (454086)Peak memory usage: 11 MB
% 0.21/0.27  % (454086)Instructions burned: 1 (million)
% 0.21/0.27  % (454073)Success in time 0.029 s
% 0.21/0.27  % Vampire exiting
%------------------------------------------------------------------------------