↑ 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  : SYO096^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 : n010.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:48:57 AM UTC 2026

% Result   : Theorem 0.09s 0.25s
% Output   : Refutation 0.09s
% Verified : 
% SZS Type : Refutation
%            Derivation depth      :   14
%            Number of leaves      :    1
% Syntax   : Number of formulae    :   18 (   5 unt;   0 typ;   0 def)
%            Number of atoms       :  196 (  44 equ;   0 cnn)
%            Maximal formula atoms :   11 (  10 avg)
%            Number of connectives :  196 (  24   ~;  15   |;  21   &; 124   @)
%                                         (   0 <=>;  12  =>;   0  <=;   0 <~>)
%            Maximal formula depth :   11 (   5 avg)
%            Number of types       :    2 (   0 usr)
%            Number of type conns  :    0 (   0   >;   0   *;   0   +;   0  <<)
%            Number of symbols     :    8 (   5 usr;   4 con; 0-2 aty)
%            Number of variables   :   50 (   0   ^;  42   !;   8   ?;  50   :)

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

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

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

thf(f1,conjecture,
    ( ( ! [X2: $i,X3: $i] :
          ( ( cQ @ X2 @ X3 )
         => ! [X4: $i] : ( cR @ X4 @ X3 ) )
      & ! [X0: $i] :
          ( ? [X1: $i] : ( cR @ X0 @ X1 )
         => ( cQ @ X0 @ X0 ) )
      & ( cR @ cA @ cB ) )
   => ? [X5: $i] :
        ( ( cQ @ X5 @ cA )
        & ( cR @ cB @ X5 ) ) ),
    file('/export/starexec/sandbox2/benchmark/theBenchmark.p',cLX1) ).

thf(f2,negated_conjecture,
    ~ ( ( ! [X2: $i,X3: $i] :
            ( ( cQ @ X2 @ X3 )
           => ! [X4: $i] : ( cR @ X4 @ X3 ) )
        & ! [X0: $i] :
            ( ? [X1: $i] : ( cR @ X0 @ X1 )
           => ( cQ @ X0 @ X0 ) )
        & ( cR @ cA @ cB ) )
     => ? [X5: $i] :
          ( ( cQ @ X5 @ cA )
          & ( cR @ cB @ X5 ) ) ),
    inference(negated_conjecture,[status(cth)],[f1]) ).

thf(f3,plain,
    ~ ( ( ! [X0: $i,X1: $i] :
            ( ( cQ @ X0 @ X1 )
           => ! [X2: $i] : ( cR @ X2 @ X1 ) )
        & ! [X3: $i] :
            ( ? [X4: $i] : ( cR @ X3 @ X4 )
           => ( cQ @ X3 @ X3 ) )
        & ( cR @ cA @ cB ) )
     => ? [X5: $i] :
          ( ( cQ @ X5 @ cA )
          & ( cR @ cB @ X5 ) ) ),
    inference(rectify,[],[f2]) ).

thf(f4,plain,
    ~ ( ( ! [X0: $i,X1: $i] :
            ( ( ( cQ @ X0 @ X1 )
              = $true )
           => ! [X2: $i] :
                ( ( cR @ X2 @ X1 )
                = $true ) )
        & ! [X3: $i] :
            ( ? [X4: $i] :
                ( ( cR @ X3 @ X4 )
                = $true )
           => ( ( cQ @ X3 @ X3 )
              = $true ) )
        & ( ( cR @ cA @ cB )
          = $true ) )
     => ? [X5: $i] :
          ( ( ( cQ @ X5 @ cA )
            = $true )
          & ( ( cR @ cB @ X5 )
            = $true ) ) ),
    inference(fool_elimination,[],[f3]) ).

thf(f5,plain,
    ( ! [X5: $i] :
        ( ( ( cQ @ X5 @ cA )
         != $true )
        | ( ( cR @ cB @ X5 )
         != $true ) )
    & ! [X0: $i,X1: $i] :
        ( ! [X2: $i] :
            ( ( cR @ X2 @ X1 )
            = $true )
        | ( ( cQ @ X0 @ X1 )
         != $true ) )
    & ! [X3: $i] :
        ( ( ( cQ @ X3 @ X3 )
          = $true )
        | ! [X4: $i] :
            ( ( cR @ X3 @ X4 )
           != $true ) )
    & ( ( cR @ cA @ cB )
      = $true ) ),
    inference(ennf_transformation,[],[f4]) ).

thf(f6,plain,
    ( ! [X5: $i] :
        ( ( ( cQ @ X5 @ cA )
         != $true )
        | ( ( cR @ cB @ X5 )
         != $true ) )
    & ! [X0: $i,X1: $i] :
        ( ! [X2: $i] :
            ( ( cR @ X2 @ X1 )
            = $true )
        | ( ( cQ @ X0 @ X1 )
         != $true ) )
    & ! [X3: $i] :
        ( ( ( cQ @ X3 @ X3 )
          = $true )
        | ! [X4: $i] :
            ( ( cR @ X3 @ X4 )
           != $true ) )
    & ( ( cR @ cA @ cB )
      = $true ) ),
    inference(flattening,[],[f5]) ).

thf(f7,plain,
    ( ! [X0: $i] :
        ( ( $true
         != ( cQ @ X0 @ cA ) )
        | ( $true
         != ( cR @ cB @ X0 ) ) )
    & ! [X1: $i,X2: $i] :
        ( ! [X3: $i] :
            ( $true
            = ( cR @ X3 @ X2 ) )
        | ( $true
         != ( cQ @ X1 @ X2 ) ) )
    & ! [X4: $i] :
        ( ( $true
          = ( cQ @ X4 @ X4 ) )
        | ! [X5: $i] :
            ( $true
           != ( cR @ X4 @ X5 ) ) )
    & ( ( cR @ cA @ cB )
      = $true ) ),
    inference(rectify,[],[f6]) ).

thf(f8,plain,
    ( ( cR @ cA @ cB )
    = $true ),
    inference(cnf_transformation,[],[f7]) ).

thf(f9,plain,
    ! [X4: $i,X5: $i] :
      ( ( $true
       != ( cR @ X4 @ X5 ) )
      | ( $true
        = ( cQ @ X4 @ X4 ) ) ),
    inference(cnf_transformation,[],[f7]) ).

thf(f10,plain,
    ! [X2: $i,X3: $i,X1: $i] :
      ( ( $true
       != ( cQ @ X1 @ X2 ) )
      | ( $true
        = ( cR @ X3 @ X2 ) ) ),
    inference(cnf_transformation,[],[f7]) ).

thf(f11,plain,
    ! [X0: $i] :
      ( ( $true
       != ( cR @ cB @ X0 ) )
      | ( $true
       != ( cQ @ X0 @ cA ) ) ),
    inference(cnf_transformation,[],[f7]) ).

thf(f14,plain,
    ( ( $true != $true )
    | ( $true
      = ( cQ @ cA @ cA ) ) ),
    inference(constrained_superposition,[],[f9,f8]) ).

thf(f15,plain,
    ( $true
    = ( cQ @ cA @ cA ) ),
    inference(trivial_inequality_removal,[],[f14]) ).

thf(f16,plain,
    ! [X0: $i] :
      ( ( $true != $true )
      | ( $true
        = ( cR @ X0 @ cA ) ) ),
    inference(constrained_superposition,[],[f10,f15]) ).

thf(f17,plain,
    ! [X0: $i] :
      ( $true
      = ( cR @ X0 @ cA ) ),
    inference(trivial_inequality_removal,[],[f16]) ).

thf(f20,plain,
    ( ( $true != $true )
    | ( $true
     != ( cQ @ cA @ cA ) ) ),
    inference(constrained_superposition,[],[f11,f17]) ).

thf(f21,plain,
    ( $true
   != ( cQ @ cA @ cA ) ),
    inference(trivial_inequality_removal,[],[f20]) ).

thf(f22,plain,
    $false,
    inference(forward_subsumption_resolution,[],[f21,f15]) ).

%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.00/0.02  % Problem  : SYO096^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.09/0.17  % Computer : n010.cluster.edu
% 0.09/0.17  % Model    : x86_64 x86_64
% 0.09/0.17  % CPU      : Intel(R) Xeon(R) CPU E5-2620 v4 @ 2.10GHz
% 0.09/0.17  % Memory   : 8046.5625MB
% 0.09/0.17  % OS       : Linux 6.8.0-71-generic
% 0.09/0.17  % CPULimit : 300
% 0.09/0.17  % WCLimit  : 300
% 0.09/0.17  % DateTime : Tue Sep 29 16:34:03 UTC 2026
% 0.09/0.18  % CPUTime  : 
% 0.09/0.18  Running run_vampire /export/starexec/sandbox2/benchmark/theBenchmark.p 300 SAT
% 0.09/0.21  Running first-order model finding
% 0.09/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.09/0.25  % (3096353)Will run a generic schedule for satisfiability detection.
% 0.09/0.25  % (3096365)dis+10_1_sil=32000:sp=arity:random_seed=2545590127:i=103:fgj=on_2999 on theBenchmark for (2999ds/103Mi)
% 0.09/0.25  % (3096365) found proof, printing to "/export/starexec/sandbox2/tmp/vampire-proof-3096353-3096365"...
% 0.09/0.25  % (3096365)...printing done.
% 0.09/0.25  % (3096365)Refutation found. Thanks to Tanya!
% 0.09/0.25  % SZS status Theorem for theBenchmark
% 0.09/0.25  % SZS output start Proof for theBenchmark
% See solution above
% 0.09/0.25  % (3096365)------------------------------
% 0.09/0.25  % (3096365)Version: Vampire 5.0.1 (Release build, commit 5ef7c2677 on 2026-07-16 16:54:09 +0200)
% 0.09/0.25  % (3096365)Linked with Z3 4.14.0.0 3c47fd96cf5645d0c42b2c819d9e9a84380aa721 z3-4.8.4-9178-g3c47fd96c
% 0.09/0.25  % (3096365)CaDiCaL version: 2.1.3
% 0.09/0.25  % (3096365)Termination reason: Refutation
% 0.09/0.25  % (3096365)Time elapsed: 0.001 s
% 0.09/0.25  % (3096365)Peak memory usage: 12 MB
% 0.09/0.25  % (3096365)Instructions burned: 2 (million)
% 0.09/0.25  % (3096353)Success in time 0.027 s
% 0.09/0.25  % Vampire exiting
%------------------------------------------------------------------------------