↑ Up

Vampire---5.0.1.THM-Ref.s

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

% Computer : n020.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:35 AM UTC 2026

% Result   : Theorem 0.21s 0.31s
% Output   : Refutation 0.21s
% Verified : 
% SZS Type : Refutation
%            Derivation depth      :    7
%            Number of leaves      :    3
% Syntax   : Number of formulae    :   16 (  16 unt;   0 typ;   0 def)
%            Number of atoms       :   32 (  10 equ;   0 cnn)
%            Maximal formula atoms :    1 (   2 avg)
%            Number of connectives :   53 (   6   ~;   0   |;   0   &;  47   @)
%                                         (   0 <=>;   0  =>;   0  <=;   0 <~>)
%            Maximal formula depth :    7 (   3 avg)
%            Number of types       :    2 (   1 usr)
%            Number of type conns  :    0 (   0   >;   0   *;   0   +;   0  <<)
%            Number of symbols     :   11 (   8 usr;   4 con; 0-2 aty)
%            Number of variables   :   13 (   0   ^;  13   !;   0   ?;  13   :)

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

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

thf(func_def_0,type,
    x: nat ).

thf(func_def_1,type,
    more: nat > nat > $o ).

thf(func_def_2,type,
    suc: nat > nat ).

thf(func_def_3,type,
    n_1: nat ).

thf(func_def_5,type,
    pl: nat > nat > nat ).

thf(func_def_8,type,
    sK0: nat > nat ).

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

thf(f4,axiom,
    ! [X0: nat,X1: nat] : ( more @ ( pl @ X0 @ X1 ) @ X0 ),
    file('/export/starexec/sandbox2/benchmark/theBenchmark.p',satz18) ).

thf(f5,axiom,
    ! [X0: nat] :
      ( ( suc @ X0 )
      = ( pl @ n_1 @ X0 ) ),
    file('/export/starexec/sandbox2/benchmark/theBenchmark.p',satz4g) ).

thf(f6,conjecture,
    more @ ( suc @ x ) @ n_1,
    file('/export/starexec/sandbox2/benchmark/theBenchmark.p',satz24b) ).

thf(f7,negated_conjecture,
    ~ ( more @ ( suc @ x ) @ n_1 ),
    inference(negated_conjecture,[status(cth)],[f6]) ).

thf(f8,plain,
    ~ ( more @ ( suc @ x ) @ n_1 ),
    inference(rectify,[],[f7]) ).

thf(f9,plain,
    ( ( more @ ( suc @ x ) @ n_1 )
   != $true ),
    inference(fool_elimination,[],[f8]) ).

thf(f12,plain,
    ! [X0: nat,X1: nat] : ( more @ ( pl @ X0 @ X1 ) @ X0 ),
    inference(rectify,[],[f4]) ).

thf(f13,plain,
    ! [X1: nat,X0: nat] :
      ( ( more @ ( pl @ X0 @ X1 ) @ X0 )
      = $true ),
    inference(fool_elimination,[],[f12]) ).

thf(f14,plain,
    ( ( more @ ( suc @ x ) @ n_1 )
   != $true ),
    inference(flattening,[],[f9]) ).

thf(f18,plain,
    ! [X0: nat,X1: nat] :
      ( $true
      = ( more @ ( pl @ X1 @ X0 ) @ X1 ) ),
    inference(rectify,[],[f13]) ).

thf(f22,plain,
    ! [X0: nat] :
      ( ( suc @ X0 )
      = ( pl @ n_1 @ X0 ) ),
    inference(cnf_transformation,[],[f5]) ).

thf(f23,plain,
    ( ( more @ ( suc @ x ) @ n_1 )
   != $true ),
    inference(cnf_transformation,[],[f14]) ).

thf(f24,plain,
    ! [X0: nat,X1: nat] :
      ( $true
      = ( more @ ( pl @ X1 @ X0 ) @ X1 ) ),
    inference(cnf_transformation,[],[f18]) ).

thf(f30,plain,
    ! [X0: nat] :
      ( $true
      = ( more @ ( suc @ X0 ) @ n_1 ) ),
    inference(constrained_superposition,[],[f24,f22]) ).

thf(f32,plain,
    $true != $true,
    inference(constrained_superposition,[],[f23,f30]) ).

thf(f33,plain,
    $false,
    inference(trivial_inequality_removal,[],[f32]) ).

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