↑ 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  : SEU850^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 : n013.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:34:17 AM UTC 2026

% Result   : Theorem 0.22s 0.28s
% Output   : Refutation 0.22s
% Verified : 
% SZS Type : Refutation
%            Derivation depth      :   10
%            Number of leaves      :    1
% Syntax   : Number of formulae    :   27 (   4 unt;   0 typ;   0 def)
%            Number of atoms       :  226 (  89 equ;   0 cnn)
%            Maximal formula atoms :    8 (   8 avg)
%            Number of connectives :  207 (  36   ~;  38   |;  27   &;  90   @)
%                                         (   0 <=>;  16  =>;   0  <=;   0 <~>)
%            Maximal formula depth :   11 (   5 avg)
%            Number of types       :    2 (   1 usr)
%            Number of type conns  :   18 (  18   >;   0   *;   0   +;   0  <<)
%            Number of symbols     :   11 (   8 usr;   5 con; 0-2 aty)
%            Number of variables   :   36 (   0   ^;  24   !;  12   ?;  36   :)

% Comments : 
%------------------------------------------------------------------------------
thf(type_def_5,type,
    a: $tType ).

thf(type_def_6,type,
    sTfun: ( $tType * $tType ) > $tType ).

thf(func_def_3,type,
    sK0: a > $o ).

thf(func_def_4,type,
    sK1: a > $o ).

thf(func_def_5,type,
    sK2: a > $o ).

thf(func_def_6,type,
    sK3: a ).

thf(func_def_7,type,
    sK4: a ).

thf(func_def_8,type,
    sK5: a ).

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

thf(f1,conjecture,
    ! [X0: a > $o,X1: a > $o,X2: a > $o] :
      ( ( ( X1 = X2 )
        & ( X0 = X1 ) )
     => ( ! [X3: a] :
            ( ( X2 @ X3 )
           => ( X0 @ X3 ) )
        & ! [X3: a] :
            ( ( X1 @ X3 )
           => ( X2 @ X3 ) )
        & ! [X3: a] :
            ( ( X0 @ X3 )
           => ( X1 @ X3 ) ) ) ),
    file('/export/starexec/sandbox2/benchmark/theBenchmark.p',cGAZING_THM9_pme) ).

thf(f2,negated_conjecture,
    ~ ! [X0: a > $o,X1: a > $o,X2: a > $o] :
        ( ( ( X1 = X2 )
          & ( X0 = X1 ) )
       => ( ! [X3: a] :
              ( ( X2 @ X3 )
             => ( X0 @ X3 ) )
          & ! [X3: a] :
              ( ( X1 @ X3 )
             => ( X2 @ X3 ) )
          & ! [X3: a] :
              ( ( X0 @ X3 )
             => ( X1 @ X3 ) ) ) ),
    inference(negated_conjecture,[status(cth)],[f1]) ).

thf(f3,plain,
    ~ ! [X0: a > $o,X1: a > $o,X2: a > $o] :
        ( ( ( X1 = X2 )
          & ( X0 = X1 ) )
       => ( ! [X3: a] :
              ( ( X2 @ X3 )
             => ( X0 @ X3 ) )
          & ! [X4: a] :
              ( ( X1 @ X4 )
             => ( X2 @ X4 ) )
          & ! [X5: a] :
              ( ( X0 @ X5 )
             => ( X1 @ X5 ) ) ) ),
    inference(rectify,[],[f2]) ).

thf(f4,plain,
    ~ ! [X0: a > $o,X1: a > $o,X2: a > $o] :
        ( ( ( X1 = X2 )
          & ( X0 = X1 ) )
       => ( ! [X3: a] :
              ( ( ( X2 @ X3 )
                = $true )
             => ( ( X0 @ X3 )
                = $true ) )
          & ! [X4: a] :
              ( ( ( X1 @ X4 )
                = $true )
             => ( ( X2 @ X4 )
                = $true ) )
          & ! [X5: a] :
              ( ( ( X0 @ X5 )
                = $true )
             => ( ( X1 @ X5 )
                = $true ) ) ) ),
    inference(fool_elimination,[],[f3]) ).

thf(f5,plain,
    ? [X0: a > $o,X1: a > $o,X2: a > $o] :
      ( ( ? [X3: a] :
            ( ( ( X0 @ X3 )
             != $true )
            & ( ( X2 @ X3 )
              = $true ) )
        | ? [X4: a] :
            ( ( ( X2 @ X4 )
             != $true )
            & ( ( X1 @ X4 )
              = $true ) )
        | ? [X5: a] :
            ( ( ( X1 @ X5 )
             != $true )
            & ( ( X0 @ X5 )
              = $true ) ) )
      & ( X1 = X2 )
      & ( X0 = X1 ) ),
    inference(ennf_transformation,[],[f4]) ).

thf(f6,plain,
    ? [X0: a > $o,X1: a > $o,X2: a > $o] :
      ( ( ? [X3: a] :
            ( ( ( X0 @ X3 )
             != $true )
            & ( ( X2 @ X3 )
              = $true ) )
        | ? [X4: a] :
            ( ( ( X2 @ X4 )
             != $true )
            & ( ( X1 @ X4 )
              = $true ) )
        | ? [X5: a] :
            ( ( ( X1 @ X5 )
             != $true )
            & ( ( X0 @ X5 )
              = $true ) ) )
      & ( X1 = X2 )
      & ( X0 = X1 ) ),
    inference(flattening,[],[f5]) ).

thf(f7,plain,
    ( ( ( ( $true
         != ( sK0 @ sK3 ) )
        & ( $true
          = ( sK2 @ sK3 ) ) )
      | ( ( $true
         != ( sK2 @ sK4 ) )
        & ( $true
          = ( sK1 @ sK4 ) ) )
      | ( ( $true
         != ( sK1 @ sK5 ) )
        & ( $true
          = ( sK0 @ sK5 ) ) ) )
    & ( sK1 = sK2 )
    & ( sK0 = sK1 ) ),
    inference(skolemize,[status(esa),new_symbols(skolem,[sK0,sK1,sK2,sK3,sK4,sK5]),skolemize(X0,sK0),skolemize(X1,sK1),skolemize(X2,sK2),skolemize(X3,sK3),skolemize(X4,sK4),skolemize(X5,sK5)],[f6]) ).

thf(f8,plain,
    sK0 = sK1,
    inference(cnf_transformation,[],[f7]) ).

thf(f9,plain,
    sK1 = sK2,
    inference(cnf_transformation,[],[f7]) ).

thf(f10,plain,
    ( ( $true
      = ( sK2 @ sK3 ) )
    | ( $true
      = ( sK1 @ sK4 ) )
    | ( $true
      = ( sK0 @ sK5 ) ) ),
    inference(cnf_transformation,[],[f7]) ).

thf(f11,plain,
    ( ( $true
      = ( sK2 @ sK3 ) )
    | ( $true
      = ( sK1 @ sK4 ) )
    | ( $true
     != ( sK1 @ sK5 ) ) ),
    inference(cnf_transformation,[],[f7]) ).

thf(f12,plain,
    ( ( $true
      = ( sK2 @ sK3 ) )
    | ( $true
     != ( sK2 @ sK4 ) )
    | ( $true
      = ( sK0 @ sK5 ) ) ),
    inference(cnf_transformation,[],[f7]) ).

thf(f13,plain,
    ( ( $true
      = ( sK2 @ sK3 ) )
    | ( $true
     != ( sK2 @ sK4 ) )
    | ( $true
     != ( sK1 @ sK5 ) ) ),
    inference(cnf_transformation,[],[f7]) ).

thf(f14,plain,
    ( ( $true
     != ( sK0 @ sK3 ) )
    | ( $true
      = ( sK1 @ sK4 ) )
    | ( $true
      = ( sK0 @ sK5 ) ) ),
    inference(cnf_transformation,[],[f7]) ).

thf(f15,plain,
    ( ( $true
     != ( sK0 @ sK3 ) )
    | ( $true
      = ( sK1 @ sK4 ) )
    | ( $true
     != ( sK1 @ sK5 ) ) ),
    inference(cnf_transformation,[],[f7]) ).

thf(f16,plain,
    ( ( $true
     != ( sK0 @ sK3 ) )
    | ( $true
     != ( sK2 @ sK4 ) )
    | ( $true
      = ( sK0 @ sK5 ) ) ),
    inference(cnf_transformation,[],[f7]) ).

thf(f17,plain,
    ( ( $true
     != ( sK0 @ sK3 ) )
    | ( $true
     != ( sK2 @ sK4 ) )
    | ( $true
     != ( sK1 @ sK5 ) ) ),
    inference(cnf_transformation,[],[f7]) ).

thf(f20,plain,
    sK0 = sK2,
    inference(definition_unfolding,[],[f8,f9]) ).

thf(f21,plain,
    ( ( $true
     != ( sK2 @ sK3 ) )
    | ( $true
     != ( sK2 @ sK4 ) )
    | ( $true
     != ( sK2 @ sK5 ) ) ),
    inference(definition_unfolding,[],[f17,f20,f9]) ).

thf(f22,plain,
    ( ( $true
     != ( sK2 @ sK3 ) )
    | ( $true
     != ( sK2 @ sK4 ) )
    | ( $true
      = ( sK2 @ sK5 ) ) ),
    inference(definition_unfolding,[],[f16,f20,f20]) ).

thf(f23,plain,
    ( ( $true
     != ( sK2 @ sK3 ) )
    | ( $true
      = ( sK2 @ sK4 ) )
    | ( $true
     != ( sK2 @ sK5 ) ) ),
    inference(definition_unfolding,[],[f15,f20,f9,f9]) ).

thf(f24,plain,
    ( ( $true
     != ( sK2 @ sK3 ) )
    | ( $true
      = ( sK2 @ sK4 ) )
    | ( $true
      = ( sK2 @ sK5 ) ) ),
    inference(definition_unfolding,[],[f14,f20,f9,f20]) ).

thf(f25,plain,
    ( ( $true
      = ( sK2 @ sK3 ) )
    | ( $true
     != ( sK2 @ sK4 ) )
    | ( $true
     != ( sK2 @ sK5 ) ) ),
    inference(definition_unfolding,[],[f13,f9]) ).

thf(f26,plain,
    ( ( $true
      = ( sK2 @ sK3 ) )
    | ( $true
     != ( sK2 @ sK4 ) )
    | ( $true
      = ( sK2 @ sK5 ) ) ),
    inference(definition_unfolding,[],[f12,f20]) ).

thf(f27,plain,
    ( ( $true
      = ( sK2 @ sK3 ) )
    | ( $true
      = ( sK2 @ sK4 ) )
    | ( $true
     != ( sK2 @ sK5 ) ) ),
    inference(definition_unfolding,[],[f11,f9,f9]) ).

thf(f28,plain,
    ( ( $true
      = ( sK2 @ sK3 ) )
    | ( $true
      = ( sK2 @ sK4 ) )
    | ( $true
      = ( sK2 @ sK5 ) ) ),
    inference(definition_unfolding,[],[f10,f9,f20]) ).

thf(f32,plain,
    $false,
    inference(global_subsumption,[],[f21,f22,f23,f24,f25,f26,f27,f28]) ).

%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.00/0.03  % Problem  : SEU850^5 : TPTP v9.3.1. Released v4.0.0.
% 0.00/0.06  % Command  : run_vampire /export/starexec/sandbox2/benchmark/theBenchmark.p 300 SAT
% 0.08/0.20  % Computer : n013.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 : Tue Sep 29 14:39:21 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.22/0.28  % (2207166)Will run a generic schedule for satisfiability detection.
% 0.22/0.28  % (2207172)% WARNING: option uhcvi not known.
% 0.22/0.28  % (2207171)fmb+10_1_sas=cadical:bce=on:rp=on:random_seed=1969147350_2999 on theBenchmark for (2999ds/0Mi)
% 0.22/0.28  % (2207172)dis+11_61:31_drc=ordering:lsd=5:bsr=unit_only:rp=on:newcnf=on:random_seed=1650370563:i=135531:add=off:rawr=on_2999 on theBenchmark for (2999ds/135531Mi)
% 0.22/0.28  % (2207173)dis+10_161_sil=256000:plsq=on:plsqr=61199697,1048576:gs=on:alpa=true:sac=on:slsq=on:cn=on:random_seed=3427323769:i=88024:add=on:rawr=on_2999 on theBenchmark for (2999ds/88024Mi)
% 0.22/0.28  % (2207176)ott+1_1_to=lpo:sil=16000:sp=reverse_arity:erd=off:random_seed=1482173667:i=131_2999 on theBenchmark for (2999ds/131Mi)
% 0.22/0.28  % (2207172)WARNING: Not using 'newcnf' as currently not compatible with higher-order inputs.
% 0.22/0.28  % (2207175)ott+31_1_sil=16000:lcm=predicate:bce=on:newcnf=on:random_seed=228858645:i=116_2999 on theBenchmark for (2999ds/116Mi)
% 0.22/0.28  % Exception at run slice level
% 0.22/0.28  User error: Finite model building is currently not compatible with polymorphism or higher-order constructs
% 0.22/0.28  % (2207172)WARNING: Look ahead literal selection is not currently compatible with higher-order. Ignoring request to use
% 0.22/0.28  % (2207175)WARNING: Not using 'newcnf' as currently not compatible with higher-order inputs.
% 0.22/0.28  % (2207173) found proof, printing to "/export/starexec/sandbox2/tmp/vampire-proof-2207166-2207173"...
% 0.22/0.28  % (2207177)ott-3_16_to=lpo:sil=16000:sp=arity:fd=off:rp=on:random_seed=3521057711:i=159:bs=unit_only:nicw=on:fsr=off:amm=off_2999 on theBenchmark for (2999ds/159Mi)
% 0.22/0.28  % (2207172) found proof, printing to "/export/starexec/sandbox2/tmp/vampire-proof-2207166-2207172"...
% 0.22/0.28  % (2207176) found proof, printing to "/export/starexec/sandbox2/tmp/vampire-proof-2207166-2207176"...
% 0.22/0.28  % (2207175) found proof, printing to "/export/starexec/sandbox2/tmp/vampire-proof-2207166-2207175"...
% 0.22/0.28  % (2207177) found proof, printing to "/export/starexec/sandbox2/tmp/vampire-proof-2207166-2207177"...
% 0.22/0.28  % (2207173)...printing done.
% 0.22/0.28  % (2207172)...printing done.
% 0.22/0.28  % (2207177)...printing done.
% 0.22/0.28  % (2207176)...printing done.
% 0.22/0.28  % (2207174)dis+10_1_sil=32000:sp=arity:random_seed=4094212038:i=103:fgj=on_2999 on theBenchmark for (2999ds/103Mi)
% 0.22/0.28  % (2207173)Refutation found. Thanks to Tanya!
% 0.22/0.28  % SZS status Theorem for theBenchmark
% 0.22/0.28  % SZS output start Proof for theBenchmark
% See solution above
% 0.22/0.28  % (2207173)------------------------------
% 0.22/0.28  % (2207173)Version: Vampire 5.0.1 (Release build, commit 5ef7c2677 on 2026-07-16 16:54:09 +0200)
% 0.22/0.28  % (2207173)Linked with Z3 4.14.0.0 3c47fd96cf5645d0c42b2c819d9e9a84380aa721 z3-4.8.4-9178-g3c47fd96c
% 0.22/0.28  % (2207173)CaDiCaL version: 2.1.3
% 0.22/0.28  % (2207173)Termination reason: Refutation
% 0.22/0.28  % (2207173)Time elapsed: 0.002 s
% 0.22/0.28  % (2207173)Peak memory usage: 11 MB
% 0.22/0.28  % (2207173)Instructions burned: 2 (million)
% 0.22/0.28  % (2207166)Success in time 0.038 s
% 0.22/0.28  % Vampire exiting
%------------------------------------------------------------------------------