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

% Computer : n009.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:32:51 PM UTC 2026

% Result   : Theorem 0.19s 0.27s
% Output   : Refutation 0.19s
% Verified : 
% SZS Type : Refutation
%            Derivation depth      :    9
%            Number of leaves      :    1
% Syntax   : Number of formulae    :   15 (   5 unt;   0 typ;   0 def)
%            Number of atoms       :   59 (   0 equ)
%            Maximal formula atoms :    8 (   3 avg)
%            Number of connectives :   72 (  28   ~;  17   |;  12   &)
%                                         (   0 <=>;  15  =>;   0  <=;   0 <~>)
%            Maximal formula depth :    8 (   4 avg)
%            Maximal term depth    :    1 (   1 avg)
%            Number of types       :    2 (   1 usr)
%            Number of type conns  :    0 (   0   >;   0   *;   0   +;   0  <<)
%            Number of predicates  :    4 (   3 usr;   1 prp; 0-2 aty)
%            Number of functors    :    2 (   2 usr;   2 con; 0-0 aty)
%            Number of variables   :   20 (  15   !;   5   ?;  20   :)

% Comments : 
%------------------------------------------------------------------------------
tff(type_def_5,type,
    '$ki_world': $tType ).

tff(func_def_0,type,
    '$ki_local_world': '$ki_world' ).

tff(func_def_1,type,
    sK0: '$ki_world' ).

tff(pred_def_1,type,
    '$ki_accessible': ( '$ki_world' * '$ki_world' ) > $o ).

tff(pred_def_2,type,
    p: '$ki_world' > $o ).

tff(pred_def_3,type,
    q: '$ki_world' > $o ).

tff(f1,conjecture,
    ( ( ! [X0: '$ki_world'] :
          ( '$ki_accessible'('$ki_local_world',X0)
         => ( p(X0)
           => q(X0) ) )
      & ! [X0: '$ki_world'] :
          ( '$ki_accessible'('$ki_local_world',X0)
         => ( p(X0)
           => ~ q(X0) ) ) )
   => ~ ? [X0: '$ki_world'] :
          ( '$ki_accessible'('$ki_local_world',X0)
          & p(X0) ) ),
    file('/export/starexec/sandbox/benchmark/theBenchmark.p',verify) ).

tff(f2,negated_conjecture,
    ~ ( ( ! [X0: '$ki_world'] :
            ( '$ki_accessible'('$ki_local_world',X0)
           => ( p(X0)
             => q(X0) ) )
        & ! [X0: '$ki_world'] :
            ( '$ki_accessible'('$ki_local_world',X0)
           => ( p(X0)
             => ~ q(X0) ) ) )
     => ~ ? [X0: '$ki_world'] :
            ( '$ki_accessible'('$ki_local_world',X0)
            & p(X0) ) ),
    inference(negated_conjecture,[status(cth)],[f1]) ).

tff(f3,plain,
    ~ ( ( ! [X0: '$ki_world'] :
            ( '$ki_accessible'('$ki_local_world',X0)
           => ( p(X0)
             => q(X0) ) )
        & ! [X1: '$ki_world'] :
            ( '$ki_accessible'('$ki_local_world',X1)
           => ( p(X1)
             => ~ q(X1) ) ) )
     => ~ ? [X2: '$ki_world'] :
            ( '$ki_accessible'('$ki_local_world',X2)
            & p(X2) ) ),
    inference(rectify,[],[f2]) ).

tff(f4,plain,
    ( ? [X2: '$ki_world'] :
        ( '$ki_accessible'('$ki_local_world',X2)
        & p(X2) )
    & ! [X0: '$ki_world'] :
        ( q(X0)
        | ~ p(X0)
        | ~ '$ki_accessible'('$ki_local_world',X0) )
    & ! [X1: '$ki_world'] :
        ( ~ q(X1)
        | ~ p(X1)
        | ~ '$ki_accessible'('$ki_local_world',X1) ) ),
    inference(ennf_transformation,[],[f3]) ).

tff(f5,plain,
    ( ? [X2: '$ki_world'] :
        ( '$ki_accessible'('$ki_local_world',X2)
        & p(X2) )
    & ! [X0: '$ki_world'] :
        ( q(X0)
        | ~ p(X0)
        | ~ '$ki_accessible'('$ki_local_world',X0) )
    & ! [X1: '$ki_world'] :
        ( ~ q(X1)
        | ~ p(X1)
        | ~ '$ki_accessible'('$ki_local_world',X1) ) ),
    inference(flattening,[],[f4]) ).

tff(f6,plain,
    p(sK0),
    inference(cnf_transformation,[],[f5]) ).

tff(f7,plain,
    '$ki_accessible'('$ki_local_world',sK0),
    inference(cnf_transformation,[],[f5]) ).

tff(f8,plain,
    ! [X0: '$ki_world'] :
      ( ~ '$ki_accessible'('$ki_local_world',X0)
      | ~ p(X0)
      | q(X0) ),
    inference(cnf_transformation,[],[f5]) ).

tff(f9,plain,
    ! [X1: '$ki_world'] :
      ( ~ '$ki_accessible'('$ki_local_world',X1)
      | ~ p(X1)
      | ~ q(X1) ),
    inference(cnf_transformation,[],[f5]) ).

tff(f10,plain,
    ! [X1: '$ki_world'] :
      ( ~ '$ki_accessible'('$ki_local_world',X1)
      | p(X1)
      | ~ q(X1) ),
    inference(consistent_polarity_flipping,[],[f9]) ).

tff(f11,plain,
    ! [X0: '$ki_world'] :
      ( ~ '$ki_accessible'('$ki_local_world',X0)
      | p(X0)
      | q(X0) ),
    inference(consistent_polarity_flipping,[],[f8]) ).

tff(f12,plain,
    ~ p(sK0),
    inference(consistent_polarity_flipping,[],[f6]) ).

tff(f15,plain,
    ! [X0: '$ki_world'] :
      ( ~ '$ki_accessible'('$ki_local_world',X0)
      | p(X0) ),
    inference(forward_subsumption_resolution,[],[f11,f10]) ).

tff(f16,plain,
    p(sK0),
    inference(resolution,[],[f15,f7]) ).

tff(f17,plain,
    $false,
    inference(forward_subsumption_resolution,[],[f16,f12]) ).

%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.00/0.02  % Problem  : SYO896_7 : TPTP v9.3.1. Released v8.2.0.
% 0.00/0.06  % Command  : run_vampire /export/starexec/sandbox/benchmark/theBenchmark.p 300 SAT
% 0.10/0.19  % Computer : n009.cluster.edu
% 0.10/0.19  % Model    : x86_64 x86_64
% 0.10/0.19  % CPU      : Intel(R) Xeon(R) CPU E5-2620 v4 @ 2.10GHz
% 0.10/0.19  % Memory   : 8046.5625MB
% 0.10/0.19  % OS       : Linux 6.8.0-71-generic
% 0.10/0.19  % CPULimit : 300
% 0.10/0.19  % WCLimit  : 300
% 0.10/0.19  % DateTime : Mon Sep 28 18:40:30 UTC 2026
% 0.10/0.20  % CPUTime  : 
% 0.10/0.20  Running run_vampire /export/starexec/sandbox/benchmark/theBenchmark.p 300 SAT
% 0.10/0.23  Running first-order model finding
% 0.10/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.19/0.27  % (3329272)Will run a generic schedule for satisfiability detection.
% 0.19/0.27  % (3329278)% WARNING: option uhcvi not known.
% 0.19/0.27  % (3329278)dis+11_61:31_drc=ordering:lsd=5:bsr=unit_only:rp=on:newcnf=on:random_seed=4206213815:i=135531:add=off:rawr=on_2999 on theBenchmark for (2999ds/135531Mi)
% 0.19/0.27  % (3329278) found proof, printing to "/export/starexec/sandbox/tmp/vampire-proof-3329272-3329278"...
% 0.19/0.27  % (3329278)...printing done.
% 0.19/0.27  % (3329278)Refutation found. Thanks to Tanya!
% 0.19/0.27  % SZS status Theorem for theBenchmark
% 0.19/0.27  % SZS output start Proof for theBenchmark
% See solution above
% 0.19/0.27  % (3329278)------------------------------
% 0.19/0.27  % (3329278)Version: Vampire 5.0.1 (Release build, commit 5ef7c2677 on 2026-07-16 16:54:09 +0200)
% 0.19/0.27  % (3329278)Linked with Z3 4.14.0.0 3c47fd96cf5645d0c42b2c819d9e9a84380aa721 z3-4.8.4-9178-g3c47fd96c
% 0.19/0.27  % (3329278)CaDiCaL version: 2.1.3
% 0.19/0.27  % (3329278)Termination reason: Refutation
% 0.19/0.27  % (3329278)Time elapsed: 0.001 s
% 0.19/0.27  % (3329278)Peak memory usage: 11 MB
% 0.19/0.27  % (3329272)Success in time 0.034 s
% 0.19/0.27  % Vampire exiting
%------------------------------------------------------------------------------