↑ 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  : NUM020^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 : 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:19:03 AM UTC 2026

% Result   : Theorem 0.09s 0.26s
% Output   : Refutation 0.09s
% Verified : 
% SZS Type : Refutation
%            Derivation depth      :    7
%            Number of leaves      :    4
% Syntax   : Number of formulae    :   17 (  17 unt;   0 typ;   0 def)
%            Number of atoms       :   17 (  16 equ;   0 cnn)
%            Maximal formula atoms :    1 (   1 avg)
%            Number of connectives :   78 (   6   ~;   0   |;   0   &;  72   @)
%                                         (   0 <=>;   0  =>;   0  <=;   0 <~>)
%            Maximal formula depth :    3 (   2 avg)
%            Number of types       :    1 (   0 usr)
%            Number of type conns  :   61 (  61   >;   0   *;   0   +;   0  <<)
%            Number of symbols     :   24 (  22 usr;   1 con; 0-4 aty)
%            Number of variables   :   47 (  40   ^;   5   !;   2   ?;  47   :)

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

thf(func_def_0,type,
    zero: ( $i > $i ) > $i > $i ).

thf(func_def_1,type,
    one: ( $i > $i ) > $i > $i ).

thf(func_def_2,type,
    two: ( $i > $i ) > $i > $i ).

thf(func_def_3,type,
    three: ( $i > $i ) > $i > $i ).

thf(func_def_4,type,
    four: ( $i > $i ) > $i > $i ).

thf(func_def_5,type,
    five: ( $i > $i ) > $i > $i ).

thf(func_def_6,type,
    six: ( $i > $i ) > $i > $i ).

thf(func_def_7,type,
    seven: ( $i > $i ) > $i > $i ).

thf(func_def_8,type,
    eight: ( $i > $i ) > $i > $i ).

thf(func_def_9,type,
    nine: ( $i > $i ) > $i > $i ).

thf(func_def_10,type,
    ten: ( $i > $i ) > $i > $i ).

thf(func_def_11,type,
    succ: ( ( $i > $i ) > $i > $i ) > ( $i > $i ) > $i > $i ).

thf(func_def_12,type,
    plus: ( ( $i > $i ) > $i > $i ) > ( ( $i > $i ) > $i > $i ) > ( $i > $i ) > $i > $i ).

thf(func_def_13,type,
    mult: ( ( $i > $i ) > $i > $i ) > ( ( $i > $i ) > $i > $i ) > ( $i > $i ) > $i > $i ).

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

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

thf(func_def_17,type,
    db1: 
      !>[X0: $tType] : X0 ).

thf(func_def_18,type,
    db2: 
      !>[X0: $tType] : X0 ).

thf(func_def_19,type,
    db3: 
      !>[X0: $tType] : X0 ).

thf(func_def_20,type,
    sK0: ( ( $i > $i ) > $i > $i ) > $i > $i ).

thf(func_def_21,type,
    sK1: ( ( $i > $i ) > $i > $i ) > $i > $i ).

thf(f4,axiom,
    ( three
    = ( ^ [X0: $i > $i,X1: $i] : ( X0 @ ( X0 @ ( X0 @ X1 ) ) ) ) ),
    file('/export/starexec/sandbox/benchmark/Axioms/NUM006^0.ax',three_ax) ).

thf(f7,axiom,
    ( six
    = ( ^ [X0: $i > $i,X1: $i] : ( X0 @ ( X0 @ ( X0 @ ( X0 @ ( X0 @ ( X0 @ X1 ) ) ) ) ) ) ) ),
    file('/export/starexec/sandbox/benchmark/Axioms/NUM006^0.ax',six_ax) ).

thf(f14,axiom,
    ( mult
    = ( ^ [X0: ( $i > $i ) > $i > $i,X1: ( $i > $i ) > $i > $i,X2: $i > $i,X3: $i] : ( X0 @ ( X1 @ X2 ) @ X3 ) ) ),
    file('/export/starexec/sandbox/benchmark/Axioms/NUM006^0.ax',mult_ax) ).

thf(f15,conjecture,
    ? [X0: ( $i > $i ) > $i > $i] :
      ( ( mult @ X0 @ three )
      = six ),
    file('/export/starexec/sandbox/benchmark/theBenchmark.p',thm) ).

thf(f16,negated_conjecture,
    ~ ? [X0: ( $i > $i ) > $i > $i] :
        ( ( mult @ X0 @ three )
        = six ),
    inference(negated_conjecture,[status(cth)],[f15]) ).

thf(f20,plain,
    ( three
    = ( ^ [Y0: $i > $i,Y1: $i] : ( Y0 @ ( Y0 @ ( Y0 @ Y1 ) ) ) ) ),
    inference(fool_elimination,[],[f4]) ).

thf(f23,plain,
    ( six
    = ( ^ [Y0: $i > $i,Y1: $i] : ( Y0 @ ( Y0 @ ( Y0 @ ( Y0 @ ( Y0 @ ( Y0 @ Y1 ) ) ) ) ) ) ) ),
    inference(fool_elimination,[],[f7]) ).

thf(f30,plain,
    ( mult
    = ( ^ [Y0: ( $i > $i ) > $i > $i,Y1: ( $i > $i ) > $i > $i,Y2: $i > $i,Y3: $i] : ( Y0 @ ( Y1 @ Y2 ) @ Y3 ) ) ),
    inference(fool_elimination,[],[f14]) ).

thf(f31,plain,
    ! [X0: ( $i > $i ) > $i > $i] :
      ( six
     != ( mult @ X0 @ three ) ),
    inference(ennf_transformation,[],[f16]) ).

thf(f35,plain,
    ( three
    = ( ^ [Y0: $i > $i,Y1: $i] : ( Y0 @ ( Y0 @ ( Y0 @ Y1 ) ) ) ) ),
    inference(cnf_transformation,[],[f20]) ).

thf(f38,plain,
    ( six
    = ( ^ [Y0: $i > $i,Y1: $i] : ( Y0 @ ( Y0 @ ( Y0 @ ( Y0 @ ( Y0 @ ( Y0 @ Y1 ) ) ) ) ) ) ) ),
    inference(cnf_transformation,[],[f23]) ).

thf(f45,plain,
    ( mult
    = ( ^ [Y0: ( $i > $i ) > $i > $i,Y1: ( $i > $i ) > $i > $i,Y2: $i > $i,Y3: $i] : ( Y0 @ ( Y1 @ Y2 ) @ Y3 ) ) ),
    inference(cnf_transformation,[],[f30]) ).

thf(f46,plain,
    ! [X0: ( $i > $i ) > $i > $i] :
      ( six
     != ( mult @ X0 @ three ) ),
    inference(cnf_transformation,[],[f31]) ).

thf(f47,plain,
    ! [X0: ( $i > $i ) > $i > $i] :
      ( ( ^ [Y0: $i > $i,Y1: $i] : ( Y0 @ ( Y0 @ ( Y0 @ ( Y0 @ ( Y0 @ ( Y0 @ Y1 ) ) ) ) ) ) )
     != ( ^ [Y0: ( $i > $i ) > $i > $i,Y1: ( $i > $i ) > $i > $i,Y2: $i > $i,Y3: $i] : ( Y0 @ ( Y1 @ Y2 ) @ Y3 )
        @ X0
        @ ^ [Y0: $i > $i,Y1: $i] : ( Y0 @ ( Y0 @ ( Y0 @ Y1 ) ) ) ) ),
    inference(definition_unfolding,[],[f46,f38,f45,f35]) ).

thf(f48,plain,
    ! [X0: ( $i > $i ) > $i > $i] :
      ( ( ^ [Y0: $i > $i,Y1: $i] : ( Y0 @ ( Y0 @ ( Y0 @ ( Y0 @ ( Y0 @ ( Y0 @ Y1 ) ) ) ) ) ) )
     != ( ^ [Y0: $i > $i] :
            ( X0
            @ ^ [Y1: $i] : ( Y0 @ ( Y0 @ ( Y0 @ Y1 ) ) ) ) ) ),
    inference(beta-eta_normalization,[],[f47]) ).

thf(f50,plain,
    ! [X0: ( $i > $i ) > $i > $i] :
      ( ( ^ [Y0: $i > $i,Y1: $i] : Y1 )
     != ( ^ [Y0: $i > $i] :
            ( X0
            @ ^ [Y1: $i] : ( Y0 @ ( Y0 @ ( Y0 @ Y1 ) ) ) ) ) ),
    inference(equality_resolution,[],[f48]) ).

thf(f53,plain,
    $false,
    inference(equality_resolution,[],[f50]) ).

%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.00/0.03  % Problem  : NUM020^1 : TPTP v9.3.1. Released v3.6.0.
% 0.00/0.05  % Command  : run_vampire /export/starexec/sandbox/benchmark/theBenchmark.p 300 SAT
% 0.09/0.18  % Computer : n003.cluster.edu
% 0.09/0.18  % Model    : x86_64 x86_64
% 0.09/0.18  % CPU      : Intel(R) Xeon(R) CPU E5-2620 v4 @ 2.10GHz
% 0.09/0.18  % Memory   : 8046.5625MB
% 0.09/0.18  % OS       : Linux 6.8.0-71-generic
% 0.09/0.18  % CPULimit : 300
% 0.09/0.18  % WCLimit  : 300
% 0.09/0.18  % DateTime : Tue Sep 29 11:56:58 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  % (2419269)Will run a generic schedule for satisfiability detection.
% 0.09/0.26  % (2419276)dis+10_161_sil=256000:plsq=on:plsqr=61199697,1048576:gs=on:alpa=true:sac=on:slsq=on:cn=on:random_seed=3163357563:i=88024:add=on:rawr=on_2999 on theBenchmark for (2999ds/88024Mi)
% 0.09/0.26  % (2419280)ott-3_16_to=lpo:sil=16000:sp=arity:fd=off:rp=on:random_seed=57308381:i=159:bs=unit_only:nicw=on:fsr=off:amm=off_2999 on theBenchmark for (2999ds/159Mi)
% 0.09/0.26  % (2419276) found proof, printing to "/export/starexec/sandbox/tmp/vampire-proof-2419269-2419276"...
% 0.09/0.26  % (2419280) found proof, printing to "/export/starexec/sandbox/tmp/vampire-proof-2419269-2419280"...
% 0.09/0.26  % (2419276)...printing done.
% 0.09/0.26  % (2419280)...printing done.
% 0.09/0.26  % (2419275)% WARNING: option uhcvi not known.
% 0.09/0.26  % (2419276)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  % (2419276)------------------------------
% 0.09/0.26  % (2419276)Version: Vampire 5.0.1 (Release build, commit 5ef7c2677 on 2026-07-16 16:54:09 +0200)
% 0.09/0.26  % (2419276)Linked with Z3 4.14.0.0 3c47fd96cf5645d0c42b2c819d9e9a84380aa721 z3-4.8.4-9178-g3c47fd96c
% 0.09/0.26  % (2419276)CaDiCaL version: 2.1.3
% 0.09/0.26  % (2419276)Termination reason: Refutation
% 0.09/0.26  % (2419276)Time elapsed: 0.003 s
% 0.09/0.26  % (2419276)Peak memory usage: 12 MB
% 0.09/0.26  % (2419276)Instructions burned: 4 (million)
% 0.09/0.26  % (2419269)Success in time 0.031 s
% 0.09/0.26  % Vampire exiting
%------------------------------------------------------------------------------