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

% Computer : n017.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      :   15
%            Number of leaves      :    1
% Syntax   : Number of formulae    :   25 (   9 unt;   0 def)
%            Number of atoms       :   95 (   0 equ)
%            Maximal formula atoms :   12 (   3 avg)
%            Number of connectives :   97 (  27   ~;  33   |;  25   &)
%                                         (   0 <=>;  12  =>;   0  <=;   0 <~>)
%            Maximal formula depth :   12 (   5 avg)
%            Maximal term depth    :    1 (   1 avg)
%            Number of predicates  :    3 (   2 usr;   1 prp; 0-2 aty)
%            Number of functors    :    4 (   4 usr;   4 con; 0-0 aty)
%            Number of variables   :   97 (  89   !;   8   ?)

% Comments : 
%------------------------------------------------------------------------------
fof(f1,conjecture,
    ( ( ( ! [X0,X1,X2] :
            ( ( p(X0,X1)
              & p(X1,X2) )
           => p(X0,X2) )
        & ! [X0,X1,X2] :
            ( ( q(X0,X1)
              & q(X1,X2) )
           => q(X0,X2) )
        & ! [X0,X1] :
            ( q(X0,X1)
           => q(X1,X0) )
        & ! [X0,X1] :
            ( p(X0,X1)
            | q(X0,X1) ) )
     => ! [X0,X1] : p(X0,X1) )
    | ! [X0,X1] : q(X0,X1) ),
    file('/export/starexec/sandbox2/benchmark/theBenchmark.p',thm400) ).

fof(f2,negated_conjecture,
    ~ ( ( ( ! [X0,X1,X2] :
              ( ( p(X0,X1)
                & p(X1,X2) )
             => p(X0,X2) )
          & ! [X0,X1,X2] :
              ( ( q(X0,X1)
                & q(X1,X2) )
             => q(X0,X2) )
          & ! [X0,X1] :
              ( q(X0,X1)
             => q(X1,X0) )
          & ! [X0,X1] :
              ( p(X0,X1)
              | q(X0,X1) ) )
       => ! [X0,X1] : p(X0,X1) )
      | ! [X0,X1] : q(X0,X1) ),
    inference(negated_conjecture,[status(cth)],[f1]) ).

fof(f3,plain,
    ~ ( ( ( ! [X0,X1,X2] :
              ( ( p(X0,X1)
                & p(X1,X2) )
             => p(X0,X2) )
          & ! [X3,X4,X5] :
              ( ( q(X3,X4)
                & q(X4,X5) )
             => q(X3,X5) )
          & ! [X6,X7] :
              ( q(X6,X7)
             => q(X7,X6) )
          & ! [X8,X9] :
              ( p(X8,X9)
              | q(X8,X9) ) )
       => ! [X10,X11] : p(X10,X11) )
      | ! [X12,X13] : q(X12,X13) ),
    inference(rectify,[],[f2]) ).

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

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

fof(f6,plain,
    ! [X2,X0,X1] :
      ( ~ p(X1,X2)
      | ~ p(X0,X1)
      | p(X0,X2) ),
    inference(cnf_transformation,[],[f5]) ).

fof(f7,plain,
    ! [X3,X4,X5] :
      ( ~ q(X4,X5)
      | ~ q(X3,X4)
      | q(X3,X5) ),
    inference(cnf_transformation,[],[f5]) ).

fof(f8,plain,
    ! [X6,X7] :
      ( ~ q(X6,X7)
      | q(X7,X6) ),
    inference(cnf_transformation,[],[f5]) ).

fof(f9,plain,
    ! [X8,X9] :
      ( p(X8,X9)
      | q(X8,X9) ),
    inference(cnf_transformation,[],[f5]) ).

fof(f10,plain,
    ~ q(sK0,sK1),
    inference(cnf_transformation,[],[f5]) ).

fof(f11,plain,
    ~ p(sK2,sK3),
    inference(cnf_transformation,[],[f5]) ).

fof(f12,plain,
    q(sK2,sK3),
    inference(resolution,[],[f9,f11]) ).

fof(f13,plain,
    q(sK3,sK2),
    inference(resolution,[],[f12,f8]) ).

fof(f14,plain,
    ! [X2,X0,X1] :
      ( ~ p(X0,X1)
      | p(X0,X2)
      | q(X1,X2) ),
    inference(resolution,[],[f6,f9]) ).

fof(f16,plain,
    ! [X0] :
      ( ~ q(X0,sK2)
      | q(X0,sK3) ),
    inference(resolution,[],[f7,f12]) ).

fof(f17,plain,
    ! [X0] :
      ( ~ q(X0,sK3)
      | q(X0,sK2) ),
    inference(resolution,[],[f7,f13]) ).

fof(f18,plain,
    ! [X2,X0,X1] :
      ( p(X0,X1)
      | q(X2,X1)
      | q(X0,X2) ),
    inference(resolution,[],[f14,f9]) ).

fof(f20,plain,
    ! [X0] :
      ( q(X0,sK3)
      | q(sK2,X0) ),
    inference(resolution,[],[f18,f11]) ).

fof(f40,plain,
    ! [X0] :
      ( q(X0,sK3)
      | q(X0,sK2) ),
    inference(resolution,[],[f20,f8]) ).

fof(f41,plain,
    ! [X0] : q(X0,sK2),
    inference(forward_subsumption_resolution,[],[f40,f17]) ).

fof(f126,plain,
    ! [X0] : q(X0,sK3),
    inference(backward_subsumption_resolution,[],[f16,f41]) ).

fof(f135,plain,
    ! [X0] : q(sK3,X0),
    inference(resolution,[],[f126,f8]) ).

fof(f138,plain,
    ! [X0,X1] :
      ( ~ q(X0,sK3)
      | q(X0,X1) ),
    inference(resolution,[],[f135,f7]) ).

fof(f140,plain,
    ! [X0,X1] : q(X0,X1),
    inference(forward_subsumption_resolution,[],[f138,f126]) ).

fof(f141,plain,
    $false,
    inference(backward_subsumption_resolution,[],[f10,f140]) ).

%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.00/0.03  % Problem  : SYN726+1 : TPTP v9.3.1. Released v2.5.0.
% 0.00/0.05  % Command  : run_vampire /export/starexec/sandbox2/benchmark/theBenchmark.p 300 SAT
% 0.08/0.19  % Computer : n017.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:44:51 UTC 2026
% 0.08/0.20  % CPUTime  : 
% 0.08/0.20  Running run_vampire /export/starexec/sandbox2/benchmark/theBenchmark.p 300 SAT
% 0.08/0.23  Running first-order model finding
% 0.08/0.23  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.08/0.27  % (3699505)Will run a generic schedule for satisfiability detection.
% 0.08/0.27  % (3699511)% WARNING: option uhcvi not known.
% 0.08/0.27  % (3699511)dis+11_61:31_drc=ordering:lsd=5:bsr=unit_only:rp=on:newcnf=on:random_seed=3724396712:i=135531:add=off:rawr=on_2999 on theBenchmark for (2999ds/135531Mi)
% 0.08/0.27  % (3699511) found proof, printing to "/export/starexec/sandbox2/tmp/vampire-proof-3699505-3699511"...
% 0.08/0.27  % (3699511)...printing done.
% 0.08/0.27  % (3699511)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  % (3699511)------------------------------
% 0.08/0.27  % (3699511)Version: Vampire 5.0.1 (Release build, commit 5ef7c2677 on 2026-07-16 16:54:09 +0200)
% 0.08/0.27  % (3699511)Linked with Z3 4.14.0.0 3c47fd96cf5645d0c42b2c819d9e9a84380aa721 z3-4.8.4-9178-g3c47fd96c
% 0.08/0.27  % (3699511)CaDiCaL version: 2.1.3
% 0.08/0.27  % (3699511)Termination reason: Refutation
% 0.08/0.27  % (3699511)Time elapsed: 0.002 s
% 0.08/0.27  % (3699511)Peak memory usage: 11 MB
% 0.08/0.27  % (3699511)Instructions burned: 6 (million)
% 0.08/0.27  % (3699505)Success in time 0.029 s
% 0.08/0.27  % Vampire exiting
%------------------------------------------------------------------------------