↑ 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  : SYO132^5 : TPTP v9.3.1. Released v4.0.0.
% Transfm  : none
% Format   : tptp:raw
% Command  : run_vampire /export/starexec/sandbox2/benchmark/theBenchmark.p 300 SAT

% Computer : n004.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 : Wed Sep 30 08:49:01 AM UTC 2026

% Result   : Theorem 0.07s 0.24s
% Output   : Refutation 0.07s
% Verified : 
% SZS Type : Refutation
%            Derivation depth      :   11
%            Number of leaves      :    3
% Syntax   : Number of formulae    :   22 (  10 unt;   0 typ;   2 def)
%            Number of atoms       :  141 (  28 equ;   0 cnn)
%            Maximal formula atoms :    9 (   6 avg)
%            Number of connectives :   78 (  15   ~;   6   |;  18   &;  33   @)
%                                         (   2 <=>;   4  =>;   0  <=;   0 <~>)
%            Maximal formula depth :    6 (   3 avg)
%            Maximal term depth    :    0 (   0 avg)
%            Number of types       :    2 (   0 usr)
%            Number of type conns  :    0 (   0   >;   0   *;   0   +;   0  <<)
%            Number of symbols     :   11 (   8 usr;   5 con; 0-2 aty)
%            Number of variables   :    0 (   0 sgn   0   !;   0   ?;   0   :)

% Comments : 
%------------------------------------------------------------------------------
thf(type_def_5,type,
    sTfun: ( $tType * $tType ) > $tType ).

thf(func_def_1,type,
    cS: $i > $o ).

thf(func_def_2,type,
    cT: $i > $o ).

thf(func_def_3,type,
    cP: ( $i > $o ) > $o ).

thf(func_def_7,type,
    vNOT: $o > $o ).

thf(f1,conjecture,
    ( ( ( cS = cT )
      & ( cT @ cX )
      & ( cP @ cS ) )
   => ( ( cS @ cX )
      & ( cP @ cT ) ) ),
    file('/export/starexec/sandbox2/benchmark/theBenchmark.p',cTHM503) ).

thf(f2,negated_conjecture,
    ~ ( ( ( cS = cT )
        & ( cT @ cX )
        & ( cP @ cS ) )
     => ( ( cS @ cX )
        & ( cP @ cT ) ) ),
    inference(negated_conjecture,[status(cth)],[f1]) ).

thf(f3,plain,
    ~ ( ( ( cS = cT )
        & ( cT @ cX )
        & ( cP @ cS ) )
     => ( ( cS @ cX )
        & ( cP @ cT ) ) ),
    inference(rectify,[],[f2]) ).

thf(f4,plain,
    ~ ( ( ( cS = cT )
        & ( ( cT @ cX )
          = $true )
        & ( ( cP @ cS )
          = $true ) )
     => ( ( ( cS @ cX )
          = $true )
        & ( ( cP @ cT )
          = $true ) ) ),
    inference(fool_elimination,[],[f3]) ).

thf(f5,plain,
    ( ( ( ( cS @ cX )
       != $true )
      | ( ( cP @ cT )
       != $true ) )
    & ( cS = cT )
    & ( ( cT @ cX )
      = $true )
    & ( ( cP @ cS )
      = $true ) ),
    inference(ennf_transformation,[],[f4]) ).

thf(f6,plain,
    ( ( ( ( cS @ cX )
       != $true )
      | ( ( cP @ cT )
       != $true ) )
    & ( cS = cT )
    & ( ( cT @ cX )
      = $true )
    & ( ( cP @ cS )
      = $true ) ),
    inference(flattening,[],[f5]) ).

thf(f7,plain,
    ( ( cP @ cS )
    = $true ),
    inference(cnf_transformation,[],[f6]) ).

thf(f8,plain,
    ( ( cT @ cX )
    = $true ),
    inference(cnf_transformation,[],[f6]) ).

thf(f9,plain,
    cS = cT,
    inference(cnf_transformation,[],[f6]) ).

thf(f10,plain,
    ( ( ( cS @ cX )
     != $true )
    | ( ( cP @ cT )
     != $true ) ),
    inference(cnf_transformation,[],[f6]) ).

thf(f13,plain,
    ( ( ( cT @ cX )
     != $true )
    | ( ( cP @ cT )
     != $true ) ),
    inference(definition_unfolding,[],[f10,f9]) ).

thf(f14,plain,
    ( ( cP @ cT )
    = $true ),
    inference(definition_unfolding,[],[f7,f9]) ).

thf(f16,definition,
    ( spl0_1
  <=> ( ( cP @ cT )
      = $true ) ),
    introduced(definition,[new_symbols(definition,[spl0_1])],[avatar_definition]) ).

thf(f20,definition,
    ( spl0_2
  <=> ( ( cT @ cX )
      = $true ) ),
    introduced(definition,[new_symbols(definition,[spl0_2])],[avatar_definition]) ).

thf(f23,plain,
    ( ~ spl0_1
    | ~ spl0_2 ),
    inference(avatar_split_clause,[],[f13,f20,f16]) ).

thf(f24,plain,
    spl0_2,
    inference(avatar_split_clause,[],[f8,f20]) ).

thf(f25,plain,
    spl0_1,
    inference(avatar_split_clause,[],[f14,f16]) ).

cnf(s1,plain,
    ( ~ spl0_1
    | ~ spl0_2 ),
    inference(sat_conversion,[],[f23]) ).

cnf(s2,plain,
    spl0_2,
    inference(sat_conversion,[],[f24]) ).

cnf(s3,plain,
    spl0_1,
    inference(sat_conversion,[],[f25]) ).

cnf(s4,plain,
    $false,
    inference(rat,[],[s1,s2,s3]) ).

thf(f26,plain,
    $false,
    inference(avatar_sat_refutation,[],[s4]) ).

%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.00/0.02  % Problem  : SYO132^5 : TPTP v9.3.1. Released v4.0.0.
% 0.00/0.05  % Command  : run_vampire /export/starexec/sandbox2/benchmark/theBenchmark.p 300 SAT
% 0.07/0.17  % Computer : n004.cluster.edu
% 0.07/0.17  % Model    : x86_64 x86_64
% 0.07/0.17  % CPU      : Intel(R) Xeon(R) CPU E5-2620 v4 @ 2.10GHz
% 0.07/0.17  % Memory   : 8046.5625MB
% 0.07/0.17  % OS       : Linux 6.8.0-71-generic
% 0.07/0.17  % CPULimit : 300
% 0.07/0.17  % WCLimit  : 300
% 0.07/0.17  % DateTime : Tue Sep 29 16:34:38 UTC 2026
% 0.07/0.17  % CPUTime  : 
% 0.07/0.18  Running run_vampire /export/starexec/sandbox2/benchmark/theBenchmark.p 300 SAT
% 0.07/0.21  Running first-order model finding
% 0.07/0.21  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.07/0.24  % (1520996)Will run a generic schedule for satisfiability detection.
% 0.07/0.24  % (1521002)% WARNING: option uhcvi not known.
% 0.07/0.24  % (1521002)dis+11_61:31_drc=ordering:lsd=5:bsr=unit_only:rp=on:newcnf=on:random_seed=3364315727:i=135531:add=off:rawr=on_2999 on theBenchmark for (2999ds/135531Mi)
% 0.07/0.24  % (1521002)WARNING: Not using 'newcnf' as currently not compatible with higher-order inputs.
% 0.07/0.24  % (1521002)WARNING: Look ahead literal selection is not currently compatible with higher-order. Ignoring request to use
% 0.07/0.24  % (1521002) found proof, printing to "/export/starexec/sandbox2/tmp/vampire-proof-1520996-1521002"...
% 0.07/0.24  % (1521002)...printing done.
% 0.07/0.24  % (1521002)Refutation found. Thanks to Tanya!
% 0.07/0.24  % SZS status Theorem for theBenchmark
% 0.07/0.24  % SZS output start Proof for theBenchmark
% See solution above
% 0.07/0.24  % (1521002)------------------------------
% 0.07/0.24  % (1521002)Version: Vampire 5.0.1 (Release build, commit 5ef7c2677 on 2026-07-16 16:54:09 +0200)
% 0.07/0.24  % (1521002)Linked with Z3 4.14.0.0 3c47fd96cf5645d0c42b2c819d9e9a84380aa721 z3-4.8.4-9178-g3c47fd96c
% 0.07/0.24  % (1521002)CaDiCaL version: 2.1.3
% 0.07/0.24  % (1521002)Termination reason: Refutation
% 0.07/0.24  % (1521002)Time elapsed: 0.001 s
% 0.07/0.24  % (1521002)Peak memory usage: 12 MB
% 0.07/0.24  % (1521002)Instructions burned: 1 (million)
% 0.07/0.24  % (1520996)Success in time 0.026 s
% 0.07/0.24  % Vampire exiting
%------------------------------------------------------------------------------