↑ Up

Vampire---5.0.1.THM-Ref.s

View TPTP
Problem
Process solution in
SystemOnTSTP
Download .tgz
%------------------------------------------------------------------------------
% File     : Vampire---5.0.1
% Problem  : NUM677^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 : 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:18:30 AM UTC 2026

% Result   : Theorem 0.21s 0.29s
% Output   : Refutation 0.21s
% Verified : 
% SZS Type : Refutation
%            Derivation depth      :   11
%            Number of leaves      :    5
% Syntax   : Number of formulae    :   30 (  21 unt;   0 typ;   0 def)
%            Number of atoms       :   92 (  36 equ;   0 cnn)
%            Maximal formula atoms :    3 (   3 avg)
%            Number of connectives :  182 (  20   ~;  10   |;   0   &; 146   @)
%                                         (   0 <=>;   6  =>;   0  <=;   0 <~>)
%            Maximal formula depth :   11 (   4 avg)
%            Number of types       :    2 (   1 usr)
%            Number of type conns  :    0 (   0   >;   0   *;   0   +;   0  <<)
%            Number of symbols     :   10 (   7 usr;   6 con; 0-2 aty)
%            Number of variables   :   39 (   0   ^;  39   !;   0   ?;  39   :)

% 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,
    y: nat ).

thf(func_def_2,type,
    z: nat ).

thf(func_def_3,type,
    u: nat ).

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

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

thf(f1,axiom,
    x = y,
    file('/export/starexec/sandbox/benchmark/theBenchmark.p',i) ).

thf(f2,axiom,
    more @ z @ u,
    file('/export/starexec/sandbox/benchmark/theBenchmark.p',m) ).

thf(f3,axiom,
    ! [X1: nat,X2: nat,X0: nat,X3: nat] :
      ( ( X0 = X1 )
     => ( ( more @ X2 @ X3 )
       => ( more @ ( pl @ X0 @ X2 ) @ ( pl @ X1 @ X3 ) ) ) ),
    file('/export/starexec/sandbox/benchmark/theBenchmark.p',satz19g) ).

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

thf(f5,conjecture,
    more @ ( pl @ z @ x ) @ ( pl @ u @ y ),
    file('/export/starexec/sandbox/benchmark/theBenchmark.p',satz19h) ).

thf(f6,negated_conjecture,
    ~ ( more @ ( pl @ z @ x ) @ ( pl @ u @ y ) ),
    inference(negated_conjecture,[status(cth)],[f5]) ).

thf(f7,plain,
    ~ ( more @ ( pl @ z @ x ) @ ( pl @ u @ y ) ),
    inference(rectify,[],[f6]) ).

thf(f8,plain,
    ( ( more @ ( pl @ z @ x ) @ ( pl @ u @ y ) )
   != $true ),
    inference(fool_elimination,[],[f7]) ).

thf(f9,plain,
    ! [X0: nat,X1: nat,X2: nat,X3: nat] :
      ( ( X0 = X2 )
     => ( ( more @ X1 @ X3 )
       => ( more @ ( pl @ X2 @ X1 ) @ ( pl @ X0 @ X3 ) ) ) ),
    inference(rectify,[],[f3]) ).

thf(f10,plain,
    ! [X2: nat,X3: nat,X1: nat,X0: nat] :
      ( ( X0 = X2 )
     => ( ( ( more @ X1 @ X3 )
          = $true )
       => ( $true
          = ( more @ ( pl @ X2 @ X1 ) @ ( pl @ X0 @ X3 ) ) ) ) ),
    inference(fool_elimination,[],[f9]) ).

thf(f11,plain,
    more @ z @ u,
    inference(rectify,[],[f2]) ).

thf(f12,plain,
    ( ( more @ z @ u )
    = $true ),
    inference(fool_elimination,[],[f11]) ).

thf(f13,plain,
    ( ( more @ ( pl @ z @ x ) @ ( pl @ u @ y ) )
   != $true ),
    inference(flattening,[],[f8]) ).

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

thf(f15,plain,
    ! [X2: nat,X3: nat,X1: nat,X0: nat] :
      ( ( $true
        = ( more @ ( pl @ X2 @ X1 ) @ ( pl @ X0 @ X3 ) ) )
      | ( ( more @ X1 @ X3 )
       != $true )
      | ( X0 != X2 ) ),
    inference(ennf_transformation,[],[f10]) ).

thf(f16,plain,
    ! [X2: nat,X1: nat,X0: nat,X3: nat] :
      ( ( ( more @ X1 @ X3 )
       != $true )
      | ( X0 != X2 )
      | ( $true
        = ( more @ ( pl @ X2 @ X1 ) @ ( pl @ X0 @ X3 ) ) ) ),
    inference(flattening,[],[f15]) ).

thf(f17,plain,
    ! [X0: nat,X1: nat,X2: nat,X3: nat] :
      ( ( ( more @ X1 @ X3 )
       != $true )
      | ( X0 != X2 )
      | ( ( more @ ( pl @ X0 @ X1 ) @ ( pl @ X2 @ X3 ) )
        = $true ) ),
    inference(rectify,[],[f16]) ).

thf(f18,plain,
    ! [X0: nat,X1: nat] :
      ( ( pl @ X0 @ X1 )
      = ( pl @ X1 @ X0 ) ),
    inference(rectify,[],[f14]) ).

thf(f19,plain,
    ! [X2: nat,X3: nat,X0: nat,X1: nat] :
      ( ( ( more @ X1 @ X3 )
       != $true )
      | ( X0 != X2 )
      | ( ( more @ ( pl @ X0 @ X1 ) @ ( pl @ X2 @ X3 ) )
        = $true ) ),
    inference(cnf_transformation,[],[f17]) ).

thf(f20,plain,
    x = y,
    inference(cnf_transformation,[],[f1]) ).

thf(f21,plain,
    ( ( more @ z @ u )
    = $true ),
    inference(cnf_transformation,[],[f12]) ).

thf(f22,plain,
    ! [X0: nat,X1: nat] :
      ( ( pl @ X0 @ X1 )
      = ( pl @ X1 @ X0 ) ),
    inference(cnf_transformation,[],[f18]) ).

thf(f23,plain,
    ( ( more @ ( pl @ z @ x ) @ ( pl @ u @ y ) )
   != $true ),
    inference(cnf_transformation,[],[f13]) ).

thf(f25,plain,
    ! [X2: nat,X3: nat,X1: nat] :
      ( ( $true
        = ( more @ ( pl @ X2 @ X1 ) @ ( pl @ X2 @ X3 ) ) )
      | ( ( more @ X1 @ X3 )
       != $true ) ),
    inference(equality_resolution,[],[f19]) ).

thf(f26,plain,
    ( $true
   != ( more @ ( pl @ z @ x ) @ ( pl @ u @ x ) ) ),
    inference(forward_demodulation,[],[f23,f20]) ).

thf(f27,plain,
    ( $true
   != ( more @ ( pl @ z @ x ) @ ( pl @ x @ u ) ) ),
    inference(superposition,[],[f26,f22]) ).

thf(f31,plain,
    ( $true
   != ( more @ ( pl @ x @ z ) @ ( pl @ x @ u ) ) ),
    inference(forward_demodulation,[],[f27,f22]) ).

thf(f39,plain,
    ( ( ( more @ z @ u )
     != $true )
    | ( $true != $true ) ),
    inference(superposition,[],[f31,f25]) ).

thf(f40,plain,
    ( ( more @ z @ u )
   != $true ),
    inference(trivial_inequality_removal,[],[f39]) ).

thf(f41,plain,
    $false,
    inference(forward_subsumption_resolution,[],[f40,f21]) ).

%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.00/0.03  % Problem  : NUM677^1 : TPTP v9.3.1. Released v3.7.0.
% 0.00/0.06  % Command  : run_vampire /export/starexec/sandbox/benchmark/theBenchmark.p 300 THM
% 0.09/0.19  % Computer : n010.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 12:36:03 UTC 2026
% 0.09/0.19  % CPUTime  : 
% 0.09/0.19  Running run_vampire /export/starexec/sandbox/benchmark/theBenchmark.p 300 THM
% 0.09/0.22  Running higher-order theorem proving
% 0.09/0.23  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.21/0.29  % (2791797)Detected a higher-order problem, will run a greedy HOL sequence.
% 0.21/0.29  % (2791816)dis+21_4_fde=none:e2e=on:si=on:uwa=off:foolp=on:random_seed=3739754144:i=24:av=off:rtra=on_2999 on theBenchmark for (2999ds/24Mi)
% 0.21/0.29  % (2791816) found proof, printing to "/export/starexec/sandbox/tmp/vampire-proof-2791797-2791816"...
% 0.21/0.29  % (2791816)...printing done.
% 0.21/0.29  % (2791816)Refutation found. Thanks to Tanya!
% 0.21/0.29  % SZS status Theorem for theBenchmark
% 0.21/0.29  % SZS output start Proof for theBenchmark
% See solution above
% 0.21/0.29  % (2791816)------------------------------
% 0.21/0.29  % (2791816)Version: Vampire 5.0.1 (Release build, commit 5ef7c2677 on 2026-07-16 16:54:09 +0200)
% 0.21/0.29  % (2791816)Linked with Z3 4.14.0.0 3c47fd96cf5645d0c42b2c819d9e9a84380aa721 z3-4.8.4-9178-g3c47fd96c
% 0.21/0.29  % (2791816)CaDiCaL version: 2.1.3
% 0.21/0.29  % (2791816)Termination reason: Refutation
% 0.21/0.29  % (2791816)Time elapsed: 0.002 s
% 0.21/0.29  % (2791816)Peak memory usage: 12 MB
% 0.21/0.29  % (2791816)Instructions burned: 3 (million)
% 0.21/0.29  % (2791797)Success in time 0.035 s
% 0.21/0.29  % Vampire exiting
%------------------------------------------------------------------------------