↑ Up

Vampire---5.0.1.THM-Ref.s

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

% Result   : Theorem 0.10s 0.25s
% Output   : Refutation 0.10s
% Verified : 
% SZS Type : Refutation
%            Derivation depth      :    8
%            Number of leaves      :    3
% Syntax   : Number of formulae    :   20 (  14 unt;   0 typ;   0 def)
%            Number of atoms       :   58 (  16 equ;   0 cnn)
%            Maximal formula atoms :    2 (   2 avg)
%            Number of connectives :  191 (   9   ~;   3   |;   0   &; 176   @)
%                                         (   0 <=>;   3  =>;   0  <=;   0 <~>)
%            Maximal formula depth :   10 (   5 avg)
%            Number of types       :    3 (   2 usr)
%            Number of type conns  :    0 (   0   >;   0   *;   0   +;   0  <<)
%            Number of symbols     :   11 (   8 usr;   5 con; 0-2 aty)
%            Number of variables   :   31 (   0   ^;  31   !;   0   ?;  31   :)

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

thf(type_def_6,type,
    frac: $tType ).

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

thf(func_def_0,type,
    x1: nat ).

thf(func_def_1,type,
    x2: nat ).

thf(func_def_2,type,
    n: nat ).

thf(func_def_3,type,
    eq: frac > frac > $o ).

thf(func_def_4,type,
    fr: nat > nat > frac ).

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

thf(func_def_6,type,
    pf: frac > frac > frac ).

thf(f1,axiom,
    ! [X0: frac,X1: frac] :
      ( ( eq @ X0 @ X1 )
     => ( eq @ X1 @ X0 ) ),
    file('/export/starexec/sandbox/benchmark/theBenchmark.p',satz38) ).

thf(f2,axiom,
    ! [X2: nat,X1: nat,X0: nat] : ( eq @ ( pf @ ( fr @ X0 @ X2 ) @ ( fr @ X1 @ X2 ) ) @ ( fr @ ( pl @ X0 @ X1 ) @ X2 ) ),
    file('/export/starexec/sandbox/benchmark/theBenchmark.p',satz57) ).

thf(f3,conjecture,
    eq @ ( fr @ ( pl @ x1 @ x2 ) @ n ) @ ( pf @ ( fr @ x1 @ n ) @ ( fr @ x2 @ n ) ),
    file('/export/starexec/sandbox/benchmark/theBenchmark.p',satz57a) ).

thf(f4,negated_conjecture,
    ~ ( eq @ ( fr @ ( pl @ x1 @ x2 ) @ n ) @ ( pf @ ( fr @ x1 @ n ) @ ( fr @ x2 @ n ) ) ),
    inference(negated_conjecture,[status(cth)],[f3]) ).

thf(f5,plain,
    ! [X0: nat,X1: nat,X2: nat] : ( eq @ ( pf @ ( fr @ X2 @ X0 ) @ ( fr @ X1 @ X0 ) ) @ ( fr @ ( pl @ X2 @ X1 ) @ X0 ) ),
    inference(rectify,[],[f2]) ).

thf(f6,plain,
    ! [X1: nat,X2: nat,X0: nat] :
      ( $true
      = ( eq @ ( pf @ ( fr @ X2 @ X0 ) @ ( fr @ X1 @ X0 ) ) @ ( fr @ ( pl @ X2 @ X1 ) @ X0 ) ) ),
    inference(fool_elimination,[],[f5]) ).

thf(f7,plain,
    ! [X0: frac,X1: frac] :
      ( ( eq @ X0 @ X1 )
     => ( eq @ X1 @ X0 ) ),
    inference(rectify,[],[f1]) ).

thf(f8,plain,
    ! [X1: frac,X0: frac] :
      ( ( ( eq @ X0 @ X1 )
        = $true )
     => ( ( eq @ X1 @ X0 )
        = $true ) ),
    inference(fool_elimination,[],[f7]) ).

thf(f9,plain,
    ~ ( eq @ ( fr @ ( pl @ x1 @ x2 ) @ n ) @ ( pf @ ( fr @ x1 @ n ) @ ( fr @ x2 @ n ) ) ),
    inference(rectify,[],[f4]) ).

thf(f10,plain,
    ( ( eq @ ( fr @ ( pl @ x1 @ x2 ) @ n ) @ ( pf @ ( fr @ x1 @ n ) @ ( fr @ x2 @ n ) ) )
   != $true ),
    inference(fool_elimination,[],[f9]) ).

thf(f11,plain,
    ( ( eq @ ( fr @ ( pl @ x1 @ x2 ) @ n ) @ ( pf @ ( fr @ x1 @ n ) @ ( fr @ x2 @ n ) ) )
   != $true ),
    inference(flattening,[],[f10]) ).

thf(f12,plain,
    ! [X0: frac,X1: frac] :
      ( ( ( eq @ X1 @ X0 )
        = $true )
      | ( ( eq @ X0 @ X1 )
       != $true ) ),
    inference(ennf_transformation,[],[f8]) ).

thf(f13,plain,
    ! [X0: nat,X1: nat,X2: nat] :
      ( $true
      = ( eq @ ( pf @ ( fr @ X1 @ X2 ) @ ( fr @ X0 @ X2 ) ) @ ( fr @ ( pl @ X1 @ X0 ) @ X2 ) ) ),
    inference(rectify,[],[f6]) ).

thf(f14,plain,
    ! [X2: nat,X0: nat,X1: nat] :
      ( $true
      = ( eq @ ( pf @ ( fr @ X1 @ X2 ) @ ( fr @ X0 @ X2 ) ) @ ( fr @ ( pl @ X1 @ X0 ) @ X2 ) ) ),
    inference(cnf_transformation,[],[f13]) ).

thf(f15,plain,
    ( ( eq @ ( fr @ ( pl @ x1 @ x2 ) @ n ) @ ( pf @ ( fr @ x1 @ n ) @ ( fr @ x2 @ n ) ) )
   != $true ),
    inference(cnf_transformation,[],[f11]) ).

thf(f16,plain,
    ! [X0: frac,X1: frac] :
      ( ( ( eq @ X0 @ X1 )
       != $true )
      | ( ( eq @ X1 @ X0 )
        = $true ) ),
    inference(cnf_transformation,[],[f12]) ).

thf(f19,plain,
    ! [X2: nat,X0: nat,X1: nat] :
      ( ( $true != $true )
      | ( $true
        = ( eq @ ( fr @ ( pl @ X0 @ X2 ) @ X1 ) @ ( pf @ ( fr @ X0 @ X1 ) @ ( fr @ X2 @ X1 ) ) ) ) ),
    inference(constrained_superposition,[],[f16,f14]) ).

thf(f20,plain,
    ! [X2: nat,X0: nat,X1: nat] :
      ( $true
      = ( eq @ ( fr @ ( pl @ X0 @ X2 ) @ X1 ) @ ( pf @ ( fr @ X0 @ X1 ) @ ( fr @ X2 @ X1 ) ) ) ),
    inference(trivial_inequality_removal,[],[f19]) ).

thf(f21,plain,
    $true != $true,
    inference(constrained_superposition,[],[f15,f20]) ).

thf(f24,plain,
    $false,
    inference(trivial_inequality_removal,[],[f21]) ).

%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.00/0.02  % Problem  : NUM747^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.10/0.17  % Computer : n017.cluster.edu
% 0.10/0.17  % Model    : x86_64 x86_64
% 0.10/0.17  % CPU      : Intel(R) Xeon(R) CPU E5-2620 v4 @ 2.10GHz
% 0.10/0.17  % Memory   : 8046.5625MB
% 0.10/0.17  % OS       : Linux 6.8.0-71-generic
% 0.10/0.17  % CPULimit : 300
% 0.10/0.17  % WCLimit  : 300
% 0.10/0.17  % DateTime : Tue Sep 29 12:44:22 UTC 2026
% 0.10/0.17  % CPUTime  : 
% 0.10/0.17  Running run_vampire /export/starexec/sandbox/benchmark/theBenchmark.p 300 THM
% 0.10/0.20  Running higher-order theorem proving
% 0.10/0.21  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.10/0.25  % (284931)Detected a higher-order problem, will run a greedy HOL sequence.
% 0.10/0.25  % (284936)lrs+10_40_drc=off:e2e=on:si=on:uwa=one_side_interpreted:random_seed=412538700:s2a=on:i=87:rtra=on:ntd=on_2999 on theBenchmark for (2999ds/87Mi)
% 0.10/0.25  % (284936) found proof, printing to "/export/starexec/sandbox/tmp/vampire-proof-284931-284936"...
% 0.10/0.25  % (284936)...printing done.
% 0.10/0.25  % (284936)Refutation found. Thanks to Tanya!
% 0.10/0.25  % SZS status Theorem for theBenchmark
% 0.10/0.25  % SZS output start Proof for theBenchmark
% See solution above
% 0.10/0.25  % (284936)------------------------------
% 0.10/0.25  % (284936)Version: Vampire 5.0.1 (Release build, commit 5ef7c2677 on 2026-07-16 16:54:09 +0200)
% 0.10/0.25  % (284936)Linked with Z3 4.14.0.0 3c47fd96cf5645d0c42b2c819d9e9a84380aa721 z3-4.8.4-9178-g3c47fd96c
% 0.10/0.25  % (284936)CaDiCaL version: 2.1.3
% 0.10/0.25  % (284936)Termination reason: Refutation
% 0.10/0.25  % (284936)Time elapsed: 0.002 s
% 0.10/0.25  % (284936)Peak memory usage: 12 MB
% 0.10/0.25  % (284936)Instructions burned: 3 (million)
% 0.10/0.25  % (284931)Success in time 0.034 s
% 0.10/0.25  % Vampire exiting
%------------------------------------------------------------------------------