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

% Computer : n008.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:14:58 AM UTC 2026

% Result   : Theorem 0.09s 0.26s
% Output   : Refutation 0.09s
% Verified : 
% SZS Type : Refutation
%            Derivation depth      :   10
%            Number of leaves      :    1
% Syntax   : Number of formulae    :   13 (   5 unt;   0 typ;   0 def)
%            Number of atoms       :   60 (  22 equ;   0 cnn)
%            Maximal formula atoms :    4 (   4 avg)
%            Number of connectives :   66 (  11   ~;   4   |;   6   &;  33   @)
%                                         (   0 <=>;  12  =>;   0  <=;   0 <~>)
%            Maximal formula depth :    8 (   5 avg)
%            Number of types       :    2 (   0 usr)
%            Number of type conns  :   14 (  14   >;   0   *;   0   +;   0  <<)
%            Number of symbols     :   11 (   8 usr;   4 con; 0-4 aty)
%            Number of variables   :   26 (   0   ^;  20   !;   6   ?;  26   :)

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

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

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

thf(func_def_8,type,
    vEQ: 
      !>[X0: $tType] : ( X0 > X0 > $o ) ).

thf(func_def_9,type,
    db0: 
      !>[X0: $tType] : X0 ).

thf(func_def_10,type,
    vLAM: 
      !>[X0: $tType,X1: $tType] : ( X1 > X0 > X1 ) ).

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

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

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

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

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

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

thf(f7,plain,
    ( ( $true
     != ( sK2 @ sK0 ) )
    & ( $true
      = ( sK2 @ sK1 ) )
    & ! [X3: $i > $o] :
        ( ( $true
          = ( X3 @ sK1 ) )
        | ( $true
         != ( X3 @ sK0 ) ) ) ),
    inference(skolemize,[status(esa),new_symbols(skolem,[sK0,sK1,sK2]),skolemize(X0,sK0),skolemize(X1,sK1),skolemize(X2,sK2)],[f6]) ).

thf(f8,plain,
    ! [X3: $i > $o] :
      ( ( $true
       != ( X3 @ sK0 ) )
      | ( $true
        = ( X3 @ sK1 ) ) ),
    inference(cnf_transformation,[],[f7]) ).

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

thf(f10,plain,
    ( $true
   != ( sK2 @ sK0 ) ),
    inference(cnf_transformation,[],[f7]) ).

thf(f19,plain,
    sK0 = sK1,
    inference(leibniz_equality_elimination,[],[f8]) ).

thf(f50,plain,
    ( $true
    = ( sK2 @ sK0 ) ),
    inference(constrained_superposition,[],[f9,f19]) ).

thf(f51,plain,
    $false,
    inference(forward_subsumption_resolution,[],[f50,f10]) ).

%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.00/0.03  % Problem  : LCL579^1 : TPTP v9.3.1. Released v3.6.0.
% 0.00/0.06  % Command  : run_vampire /export/starexec/sandbox/benchmark/theBenchmark.p 300 SAT
% 0.09/0.19  % Computer : n008.cluster.edu
% 0.09/0.19  % Model    : x86_64 x86_64
% 0.09/0.19  % CPU      : Intel(R) Xeon(R) CPU E5-2620 v4 @ 2.10GHz
% 0.09/0.19  % Memory   : 8046.5625MB
% 0.09/0.19  % OS       : Linux 6.8.0-71-generic
% 0.09/0.19  % CPULimit : 300
% 0.09/0.19  % WCLimit  : 300
% 0.09/0.19  % DateTime : Tue Sep 29 08:54:55 UTC 2026
% 0.09/0.19  % CPUTime  : 
% 0.09/0.19  Running run_vampire /export/starexec/sandbox/benchmark/theBenchmark.p 300 SAT
% 0.09/0.22  Running first-order model finding
% 0.09/0.22  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.09/0.26  % (2879307)Will run a generic schedule for satisfiability detection.
% 0.09/0.26  % (2879314)dis+10_161_sil=256000:plsq=on:plsqr=61199697,1048576:gs=on:alpa=true:sac=on:slsq=on:cn=on:random_seed=3109939267:i=88024:add=on:rawr=on_2999 on theBenchmark for (2999ds/88024Mi)
% 0.09/0.26  % (2879314) found proof, printing to "/export/starexec/sandbox/tmp/vampire-proof-2879307-2879314"...
% 0.09/0.26  % (2879314)...printing done.
% 0.09/0.26  % (2879314)Refutation found. Thanks to Tanya!
% 0.09/0.26  % SZS status Theorem for theBenchmark
% 0.09/0.26  % SZS output start Proof for theBenchmark
% See solution above
% 0.09/0.26  % (2879314)------------------------------
% 0.09/0.26  % (2879314)Version: Vampire 5.0.1 (Release build, commit 5ef7c2677 on 2026-07-16 16:54:09 +0200)
% 0.09/0.26  % (2879314)Linked with Z3 4.14.0.0 3c47fd96cf5645d0c42b2c819d9e9a84380aa721 z3-4.8.4-9178-g3c47fd96c
% 0.09/0.26  % (2879314)CaDiCaL version: 2.1.3
% 0.09/0.26  % (2879314)Termination reason: Refutation
% 0.09/0.26  % (2879314)Time elapsed: 0.001 s
% 0.09/0.26  % (2879314)Peak memory usage: 12 MB
% 0.09/0.26  % (2879314)Instructions burned: 2 (million)
% 0.09/0.26  % (2879307)Success in time 0.028 s
% 0.09/0.26  % Vampire exiting
%------------------------------------------------------------------------------