↑ Up

Vampire---5.0.1.THM-Ref.s

View TPTP
Problem
Process solution in
SystemOnTSTP
Download .tgz
%------------------------------------------------------------------------------
% File     : Vampire---5.0.1
% Problem  : NUM791^1 : TPTP v9.3.1. Released v3.7.0.
% Transfm  : none
% Format   : tptp:raw
% Command  : run_vampire /export/starexec/sandbox/benchmark/theBenchmark.p 300 THM

% Computer : n003.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:18:54 AM UTC 2026

% Result   : Theorem 0.18s 0.26s
% Output   : Refutation 0.18s
% Verified : 
% SZS Type : Refutation
%            Derivation depth      :   11
%            Number of leaves      :    3
% Syntax   : Number of formulae    :   25 (  10 unt;   0 typ;   0 def)
%            Number of atoms       :  119 (  35 equ;   0 cnn)
%            Maximal formula atoms :    3 (   4 avg)
%            Number of connectives :  144 (  26   ~;  11   |;   1   &;  94   @)
%                                         (   0 <=>;  12  =>;   0  <=;   0 <~>)
%            Maximal formula depth :    8 (   4 avg)
%            Number of types       :    2 (   1 usr)
%            Number of type conns  :    0 (   0   >;   0   *;   0   +;   0  <<)
%            Number of symbols     :   10 (   7 usr;   4 con; 0-2 aty)
%            Number of variables   :   16 (   0   ^;  16   !;   0   ?;  16   :)

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

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

thf(func_def_0,type,
    x0: rat ).

thf(func_def_1,type,
    y0: rat ).

thf(func_def_2,type,
    less: rat > rat > $o ).

thf(func_def_3,type,
    is: rat > rat > $o ).

thf(func_def_5,type,
    more: rat > rat > $o ).

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

thf(f1,axiom,
    ~ ( ~ ( less @ x0 @ y0 )
     => ( is @ x0 @ y0 ) ),
    file('/export/starexec/sandbox/benchmark/theBenchmark.p',n) ).

thf(f3,axiom,
    ! [X0: rat,X1: rat] :
      ( ~ ( is @ X0 @ X1 )
     => ( ~ ( more @ X0 @ X1 )
       => ( less @ X0 @ X1 ) ) ),
    file('/export/starexec/sandbox/benchmark/theBenchmark.p',satz81a) ).

thf(f4,conjecture,
    more @ x0 @ y0,
    file('/export/starexec/sandbox/benchmark/theBenchmark.p',satz81k) ).

thf(f5,negated_conjecture,
    ~ ( more @ x0 @ y0 ),
    inference(negated_conjecture,[status(cth)],[f4]) ).

thf(f8,plain,
    ! [X0: rat,X1: rat] :
      ( ~ ( is @ X0 @ X1 )
     => ( ~ ( more @ X0 @ X1 )
       => ( less @ X0 @ X1 ) ) ),
    inference(rectify,[],[f3]) ).

thf(f9,plain,
    ! [X0: rat,X1: rat] :
      ( ( ( is @ X0 @ X1 )
       != $true )
     => ( ( ( more @ X0 @ X1 )
         != $true )
       => ( ( less @ X0 @ X1 )
          = $true ) ) ),
    inference(fool_elimination,[],[f8]) ).

thf(f10,plain,
    ~ ( ~ ( less @ x0 @ y0 )
     => ( is @ x0 @ y0 ) ),
    inference(rectify,[],[f1]) ).

thf(f11,plain,
    ~ ( ( ( less @ x0 @ y0 )
       != $true )
     => ( ( is @ x0 @ y0 )
        = $true ) ),
    inference(fool_elimination,[],[f10]) ).

thf(f12,plain,
    ~ ( more @ x0 @ y0 ),
    inference(rectify,[],[f5]) ).

thf(f13,plain,
    ( ( more @ x0 @ y0 )
   != $true ),
    inference(fool_elimination,[],[f12]) ).

thf(f15,plain,
    ! [X0: rat,X1: rat] :
      ( ( ( is @ X0 @ X1 )
       != $true )
     => ( ( ( more @ X0 @ X1 )
         != $true )
       => ( ( less @ X0 @ X1 )
          = $true ) ) ),
    inference(flattening,[],[f9]) ).

thf(f16,plain,
    ~ ( ( ( less @ x0 @ y0 )
       != $true )
     => ( ( is @ x0 @ y0 )
        = $true ) ),
    inference(flattening,[],[f11]) ).

thf(f17,plain,
    ( ( more @ x0 @ y0 )
   != $true ),
    inference(flattening,[],[f13]) ).

thf(f18,plain,
    ( ( ( is @ x0 @ y0 )
     != $true )
    & ( ( less @ x0 @ y0 )
     != $true ) ),
    inference(ennf_transformation,[],[f16]) ).

thf(f19,plain,
    ! [X0: rat,X1: rat] :
      ( ( ( less @ X0 @ X1 )
        = $true )
      | ( ( more @ X0 @ X1 )
        = $true )
      | ( ( is @ X0 @ X1 )
        = $true ) ),
    inference(ennf_transformation,[],[f15]) ).

thf(f20,plain,
    ! [X1: rat,X0: rat] :
      ( ( ( is @ X0 @ X1 )
        = $true )
      | ( ( less @ X0 @ X1 )
        = $true )
      | ( ( more @ X0 @ X1 )
        = $true ) ),
    inference(flattening,[],[f19]) ).

thf(f22,plain,
    ! [X0: rat,X1: rat] :
      ( ( $true
        = ( is @ X1 @ X0 ) )
      | ( $true
        = ( less @ X1 @ X0 ) )
      | ( ( more @ X1 @ X0 )
        = $true ) ),
    inference(rectify,[],[f20]) ).

thf(f23,plain,
    ( ( less @ x0 @ y0 )
   != $true ),
    inference(cnf_transformation,[],[f18]) ).

thf(f24,plain,
    ( ( is @ x0 @ y0 )
   != $true ),
    inference(cnf_transformation,[],[f18]) ).

thf(f25,plain,
    ! [X0: rat,X1: rat] :
      ( ( $true
        = ( less @ X1 @ X0 ) )
      | ( $true
        = ( is @ X1 @ X0 ) )
      | ( ( more @ X1 @ X0 )
        = $true ) ),
    inference(cnf_transformation,[],[f22]) ).

thf(f26,plain,
    ( ( more @ x0 @ y0 )
   != $true ),
    inference(cnf_transformation,[],[f17]) ).

thf(f31,plain,
    ( ( ( more @ x0 @ y0 )
      = $true )
    | ( $true != $true )
    | ( ( is @ x0 @ y0 )
      = $true ) ),
    inference(constrained_superposition,[],[f23,f25]) ).

thf(f32,plain,
    ( ( ( more @ x0 @ y0 )
      = $true )
    | ( ( is @ x0 @ y0 )
      = $true ) ),
    inference(trivial_inequality_removal,[],[f31]) ).

thf(f33,plain,
    ( ( is @ x0 @ y0 )
    = $true ),
    inference(forward_subsumption_resolution,[],[f32,f26]) ).

thf(f34,plain,
    $false,
    inference(forward_subsumption_resolution,[],[f33,f24]) ).

%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.00/0.03  % Problem  : NUM791^1 : TPTP v9.3.1. Released v3.7.0.
% 0.00/0.05  % Command  : run_vampire /export/starexec/sandbox/benchmark/theBenchmark.p 300 THM
% 0.07/0.18  % Computer : n003.cluster.edu
% 0.07/0.18  % Model    : x86_64 x86_64
% 0.07/0.18  % CPU      : Intel(R) Xeon(R) CPU E5-2620 v4 @ 2.10GHz
% 0.07/0.18  % Memory   : 8046.5625MB
% 0.07/0.18  % OS       : Linux 6.8.0-71-generic
% 0.07/0.18  % CPULimit : 300
% 0.07/0.18  % WCLimit  : 300
% 0.07/0.18  % DateTime : Tue Sep 29 13:00:02 UTC 2026
% 0.07/0.18  % CPUTime  : 
% 0.07/0.19  Running run_vampire /export/starexec/sandbox/benchmark/theBenchmark.p 300 THM
% 0.07/0.21  Running higher-order theorem proving
% 0.07/0.22  Running: /export/starexec/sandbox/solver/bin/vampire-ho --input_syntax tptp --output_axiom_names on --mode casc -m 16384 --cores 7 -t 300 /export/starexec/sandbox/benchmark/theBenchmark.p
% 0.18/0.26  % (2462131)Detected a higher-order problem, will run a greedy HOL sequence.
% 0.18/0.26  % (2462136)lrs+10_40_drc=off:e2e=on:si=on:uwa=one_side_interpreted:random_seed=4125513768:s2a=on:i=87:rtra=on:ntd=on_2999 on theBenchmark for (2999ds/87Mi)
% 0.18/0.26  % (2462136) found proof, printing to "/export/starexec/sandbox/tmp/vampire-proof-2462131-2462136"...
% 0.18/0.26  % (2462136)...printing done.
% 0.18/0.26  % (2462136)Refutation found. Thanks to Tanya!
% 0.18/0.26  % SZS status Theorem for theBenchmark
% 0.18/0.26  % SZS output start Proof for theBenchmark
% See solution above
% 0.18/0.26  % (2462136)------------------------------
% 0.18/0.26  % (2462136)Version: Vampire 5.0.1 (Release build, commit 5ef7c2677 on 2026-07-16 16:54:09 +0200)
% 0.18/0.27  % (2462136)Linked with Z3 4.14.0.0 3c47fd96cf5645d0c42b2c819d9e9a84380aa721 z3-4.8.4-9178-g3c47fd96c
% 0.18/0.27  % (2462136)CaDiCaL version: 2.1.3
% 0.18/0.27  % (2462136)Termination reason: Refutation
% 0.18/0.27  % (2462136)Time elapsed: 0.001 s
% 0.18/0.27  % (2462136)Peak memory usage: 12 MB
% 0.18/0.27  % (2462136)Instructions burned: 2 (million)
% 0.18/0.27  % (2462131)Success in time 0.03 s
% 0.18/0.27  % Vampire exiting
%------------------------------------------------------------------------------