↑ 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  : ANA105^1 : TPTP v9.3.1. Released v7.0.0.
% Transfm  : none
% Format   : tptp:raw
% Command  : run_vampire /export/starexec/sandbox2/benchmark/theBenchmark.p 300 SAT

% Computer : n006.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 07:46:04 AM UTC 2026

% Result   : Theorem 0.18s 0.27s
% Output   : Refutation 0.18s
% Verified : 
% SZS Type : Refutation
%            Derivation depth      :    9
%            Number of leaves      :    3
% Syntax   : Number of formulae    :   19 (  11 unt;   0 typ;   0 def)
%            Number of atoms       :   68 (  20 equ;   0 cnn)
%            Maximal formula atoms :    2 (   3 avg)
%            Number of connectives :  291 (  11   ~;   3   |;   0   &; 274   @)
%                                         (   0 <=>;   3  =>;   0  <=;   0 <~>)
%            Maximal formula depth :    8 (   5 avg)
%            Number of types       :    3 (   2 usr)
%            Number of type conns  :   25 (  25   >;   0   *;   0   +;   0  <<)
%            Number of symbols     :   14 (  11 usr;   4 con; 0-4 aty)
%            Number of variables   :   62 (  14   ^;  44   !;   4   ?;  62   :)

% Comments : 
%------------------------------------------------------------------------------
thf(type_def_5,type,
    'type/realax/real': $tType ).

thf(type_def_6,type,
    'type/nums/num': $tType ).

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

thf(func_def_0,type,
    'const/sets/FINITE': 
      !>[X0: $tType] : ( ( X0 > $o ) > $o ) ).

thf(func_def_1,type,
    'const/realax/real_add': 'type/realax/real' > 'type/realax/real' > 'type/realax/real' ).

thf(func_def_2,type,
    'const/iterate/sum': 
      !>[X0: $tType] : ( ( X0 > $o ) > ( X0 > 'type/realax/real' ) > 'type/realax/real' ) ).

thf(func_def_3,type,
    'const/iterate/..': 'type/nums/num' > 'type/nums/num' > 'type/nums/num' > $o ).

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

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

thf(func_def_9,type,
    sK0: 'type/nums/num' > 'type/realax/real' ).

thf(func_def_10,type,
    sK1: 'type/nums/num' > 'type/realax/real' ).

thf(func_def_11,type,
    sK2: 'type/nums/num' ).

thf(func_def_12,type,
    sK3: 'type/nums/num' ).

thf(f1,axiom,
    ! [X0: $tType,X1: X0 > 'type/realax/real',X2: X0 > 'type/realax/real',X3: X0 > $o] :
      ( ( 'const/sets/FINITE' @ X0 @ X3 )
     => ( ( 'const/iterate/sum' @ X0 @ X3
          @ ^ [X4: X0] : ( 'const/realax/real_add' @ ( X1 @ X4 ) @ ( X2 @ X4 ) ) )
        = ( 'const/realax/real_add' @ ( 'const/iterate/sum' @ X0 @ X3 @ X1 ) @ ( 'const/iterate/sum' @ X0 @ X3 @ X2 ) ) ) ),
    file('/export/starexec/sandbox2/benchmark/theBenchmark.p','thm/iterate/SUM_ADD_') ).

thf(f2,axiom,
    ! [X0: 'type/nums/num',X1: 'type/nums/num'] : ( 'const/sets/FINITE' @ 'type/nums/num' @ ( 'const/iterate/..' @ X0 @ X1 ) ),
    file('/export/starexec/sandbox2/benchmark/theBenchmark.p','thm/iterate/FINITE_NUMSEG_') ).

thf(f3,conjecture,
    ! [X0: 'type/nums/num' > 'type/realax/real',X1: 'type/nums/num' > 'type/realax/real',X2: 'type/nums/num',X3: 'type/nums/num'] :
      ( ( 'const/iterate/sum' @ 'type/nums/num' @ ( 'const/iterate/..' @ X2 @ X3 )
        @ ^ [X4: 'type/nums/num'] : ( 'const/realax/real_add' @ ( X0 @ X4 ) @ ( X1 @ X4 ) ) )
      = ( 'const/realax/real_add' @ ( 'const/iterate/sum' @ 'type/nums/num' @ ( 'const/iterate/..' @ X2 @ X3 ) @ X0 ) @ ( 'const/iterate/sum' @ 'type/nums/num' @ ( 'const/iterate/..' @ X2 @ X3 ) @ X1 ) ) ),
    file('/export/starexec/sandbox2/benchmark/theBenchmark.p','thm/iterate/SUM_ADD_NUMSEG_') ).

thf(f4,negated_conjecture,
    ~ ! [X0: 'type/nums/num' > 'type/realax/real',X1: 'type/nums/num' > 'type/realax/real',X2: 'type/nums/num',X3: 'type/nums/num'] :
        ( ( 'const/iterate/sum' @ 'type/nums/num' @ ( 'const/iterate/..' @ X2 @ X3 )
          @ ^ [X4: 'type/nums/num'] : ( 'const/realax/real_add' @ ( X0 @ X4 ) @ ( X1 @ X4 ) ) )
        = ( 'const/realax/real_add' @ ( 'const/iterate/sum' @ 'type/nums/num' @ ( 'const/iterate/..' @ X2 @ X3 ) @ X0 ) @ ( 'const/iterate/sum' @ 'type/nums/num' @ ( 'const/iterate/..' @ X2 @ X3 ) @ X1 ) ) ),
    inference(negated_conjecture,[status(cth)],[f3]) ).

thf(f5,plain,
    ! [X0: $tType,X1: X0 > 'type/realax/real',X2: X0 > 'type/realax/real',X3: X0 > $o] :
      ( ( 'const/sets/FINITE' @ X0 @ X3 )
     => ( ( 'const/iterate/sum' @ X0 @ X3
          @ ^ [X4: X0] : ( 'const/realax/real_add' @ ( X1 @ X4 ) @ ( X2 @ X4 ) ) )
        = ( 'const/realax/real_add' @ ( 'const/iterate/sum' @ X0 @ X3 @ X1 ) @ ( 'const/iterate/sum' @ X0 @ X3 @ X2 ) ) ) ),
    inference(rectify,[],[f1]) ).

thf(f6,plain,
    ! [X0: $tType,X1: X0 > 'type/realax/real',X2: X0 > 'type/realax/real',X3: X0 > $o] :
      ( ( ( 'const/sets/FINITE' @ X0 @ X3 )
        = $true )
     => ( ( 'const/realax/real_add' @ ( 'const/iterate/sum' @ X0 @ X3 @ X1 ) @ ( 'const/iterate/sum' @ X0 @ X3 @ X2 ) )
        = ( 'const/iterate/sum' @ X0 @ X3
          @ ^ [Y0: X0] : ( 'const/realax/real_add' @ ( X1 @ Y0 ) @ ( X2 @ Y0 ) ) ) ) ),
    inference(fool_elimination,[],[f5]) ).

thf(f7,plain,
    ! [X0: 'type/nums/num',X1: 'type/nums/num'] : ( 'const/sets/FINITE' @ 'type/nums/num' @ ( 'const/iterate/..' @ X0 @ X1 ) ),
    inference(rectify,[],[f2]) ).

thf(f8,plain,
    ! [X0: 'type/nums/num',X1: 'type/nums/num'] :
      ( ( 'const/sets/FINITE' @ 'type/nums/num' @ ( 'const/iterate/..' @ X0 @ X1 ) )
      = $true ),
    inference(fool_elimination,[],[f7]) ).

thf(f9,plain,
    ~ ! [X0: 'type/nums/num' > 'type/realax/real',X1: 'type/nums/num' > 'type/realax/real',X2: 'type/nums/num',X3: 'type/nums/num'] :
        ( ( 'const/iterate/sum' @ 'type/nums/num' @ ( 'const/iterate/..' @ X2 @ X3 )
          @ ^ [X4: 'type/nums/num'] : ( 'const/realax/real_add' @ ( X0 @ X4 ) @ ( X1 @ X4 ) ) )
        = ( 'const/realax/real_add' @ ( 'const/iterate/sum' @ 'type/nums/num' @ ( 'const/iterate/..' @ X2 @ X3 ) @ X0 ) @ ( 'const/iterate/sum' @ 'type/nums/num' @ ( 'const/iterate/..' @ X2 @ X3 ) @ X1 ) ) ),
    inference(rectify,[],[f4]) ).

thf(f10,plain,
    ~ ! [X0: 'type/nums/num' > 'type/realax/real',X1: 'type/nums/num' > 'type/realax/real',X2: 'type/nums/num',X3: 'type/nums/num'] :
        ( ( 'const/realax/real_add' @ ( 'const/iterate/sum' @ 'type/nums/num' @ ( 'const/iterate/..' @ X2 @ X3 ) @ X0 ) @ ( 'const/iterate/sum' @ 'type/nums/num' @ ( 'const/iterate/..' @ X2 @ X3 ) @ X1 ) )
        = ( 'const/iterate/sum' @ 'type/nums/num' @ ( 'const/iterate/..' @ X2 @ X3 )
          @ ^ [Y0: 'type/nums/num'] : ( 'const/realax/real_add' @ ( X0 @ Y0 ) @ ( X1 @ Y0 ) ) ) ),
    inference(fool_elimination,[],[f9]) ).

thf(f11,plain,
    ! [X0: $tType,X1: X0 > 'type/realax/real',X2: X0 > 'type/realax/real',X3: X0 > $o] :
      ( ( ( 'const/realax/real_add' @ ( 'const/iterate/sum' @ X0 @ X3 @ X1 ) @ ( 'const/iterate/sum' @ X0 @ X3 @ X2 ) )
        = ( 'const/iterate/sum' @ X0 @ X3
          @ ^ [Y0: X0] : ( 'const/realax/real_add' @ ( X1 @ Y0 ) @ ( X2 @ Y0 ) ) ) )
      | ( ( 'const/sets/FINITE' @ X0 @ X3 )
       != $true ) ),
    inference(ennf_transformation,[],[f6]) ).

thf(f12,plain,
    ? [X0: 'type/nums/num' > 'type/realax/real',X1: 'type/nums/num' > 'type/realax/real',X2: 'type/nums/num',X3: 'type/nums/num'] :
      ( ( 'const/realax/real_add' @ ( 'const/iterate/sum' @ 'type/nums/num' @ ( 'const/iterate/..' @ X2 @ X3 ) @ X0 ) @ ( 'const/iterate/sum' @ 'type/nums/num' @ ( 'const/iterate/..' @ X2 @ X3 ) @ X1 ) )
     != ( 'const/iterate/sum' @ 'type/nums/num' @ ( 'const/iterate/..' @ X2 @ X3 )
        @ ^ [Y0: 'type/nums/num'] : ( 'const/realax/real_add' @ ( X0 @ Y0 ) @ ( X1 @ Y0 ) ) ) ),
    inference(ennf_transformation,[],[f10]) ).

thf(f13,plain,
    ( ( 'const/realax/real_add' @ ( 'const/iterate/sum' @ 'type/nums/num' @ ( 'const/iterate/..' @ sK2 @ sK3 ) @ sK0 ) @ ( 'const/iterate/sum' @ 'type/nums/num' @ ( 'const/iterate/..' @ sK2 @ sK3 ) @ sK1 ) )
   != ( 'const/iterate/sum' @ 'type/nums/num' @ ( 'const/iterate/..' @ sK2 @ sK3 )
      @ ^ [Y0: 'type/nums/num'] : ( 'const/realax/real_add' @ ( sK0 @ Y0 ) @ ( sK1 @ Y0 ) ) ) ),
    inference(skolemize,[status(esa),new_symbols(skolem,[sK0,sK1,sK2,sK3]),skolemize(X0,sK0),skolemize(X1,sK1),skolemize(X2,sK2),skolemize(X3,sK3)],[f12]) ).

thf(f14,plain,
    ! [X0: $tType,X2: X0 > 'type/realax/real',X3: X0 > $o,X1: X0 > 'type/realax/real'] :
      ( ( ( 'const/realax/real_add' @ ( 'const/iterate/sum' @ X0 @ X3 @ X1 ) @ ( 'const/iterate/sum' @ X0 @ X3 @ X2 ) )
        = ( 'const/iterate/sum' @ X0 @ X3
          @ ^ [Y0: X0] : ( 'const/realax/real_add' @ ( X1 @ Y0 ) @ ( X2 @ Y0 ) ) ) )
      | ( ( 'const/sets/FINITE' @ X0 @ X3 )
       != $true ) ),
    inference(cnf_transformation,[],[f11]) ).

thf(f15,plain,
    ! [X0: 'type/nums/num',X1: 'type/nums/num'] :
      ( ( 'const/sets/FINITE' @ 'type/nums/num' @ ( 'const/iterate/..' @ X0 @ X1 ) )
      = $true ),
    inference(cnf_transformation,[],[f8]) ).

thf(f16,plain,
    ( ( 'const/realax/real_add' @ ( 'const/iterate/sum' @ 'type/nums/num' @ ( 'const/iterate/..' @ sK2 @ sK3 ) @ sK0 ) @ ( 'const/iterate/sum' @ 'type/nums/num' @ ( 'const/iterate/..' @ sK2 @ sK3 ) @ sK1 ) )
   != ( 'const/iterate/sum' @ 'type/nums/num' @ ( 'const/iterate/..' @ sK2 @ sK3 )
      @ ^ [Y0: 'type/nums/num'] : ( 'const/realax/real_add' @ ( sK0 @ Y0 ) @ ( sK1 @ Y0 ) ) ) ),
    inference(cnf_transformation,[],[f13]) ).

thf(f29,plain,
    ( ( ( 'const/iterate/sum' @ 'type/nums/num' @ ( 'const/iterate/..' @ sK2 @ sK3 )
        @ ^ [Y0: 'type/nums/num'] : ( 'const/realax/real_add' @ ( sK0 @ Y0 ) @ ( sK1 @ Y0 ) ) )
     != ( 'const/iterate/sum' @ 'type/nums/num' @ ( 'const/iterate/..' @ sK2 @ sK3 )
        @ ^ [Y0: 'type/nums/num'] : ( 'const/realax/real_add' @ ( sK0 @ Y0 ) @ ( sK1 @ Y0 ) ) ) )
    | ( $true
     != ( 'const/sets/FINITE' @ 'type/nums/num' @ ( 'const/iterate/..' @ sK2 @ sK3 ) ) ) ),
    inference(constrained_superposition,[],[f16,f14]) ).

thf(f30,plain,
    ( $true
   != ( 'const/sets/FINITE' @ 'type/nums/num' @ ( 'const/iterate/..' @ sK2 @ sK3 ) ) ),
    inference(trivial_inequality_removal,[],[f29]) ).

thf(f36,plain,
    $false,
    inference(forward_subsumption_resolution,[],[f30,f15]) ).

%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.00/0.02  % Problem  : ANA105^1 : TPTP v9.3.1. Released v7.0.0.
% 0.00/0.05  % Command  : run_vampire /export/starexec/sandbox2/benchmark/theBenchmark.p 300 SAT
% 0.07/0.18  % Computer : n006.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 17:41:24 UTC 2026
% 0.07/0.18  % CPUTime  : 
% 0.07/0.18  Running run_vampire /export/starexec/sandbox2/benchmark/theBenchmark.p 300 SAT
% 0.07/0.22  Running first-order model finding
% 0.07/0.22  Running: /export/starexec/sandbox2/solver/bin/vampire-ho --input_syntax tptp --output_axiom_names on --mode casc --intent sat -m 16384 --cores 7 -t 300 /export/starexec/sandbox2/benchmark/theBenchmark.p
% 0.18/0.27  % (1075423)Will run a generic schedule for satisfiability detection.
% 0.18/0.27  % (1075443)fmb+10_1_sas=cadical:bce=on:rp=on:random_seed=1042236865_2999 on theBenchmark for (2999ds/0Mi)
% 0.18/0.27  % Exception at run slice level
% 0.18/0.27  User error: Finite model building is currently not compatible with polymorphism or higher-order constructs
% 0.18/0.27  % (1075444)% WARNING: option uhcvi not known.
% 0.18/0.27  % (1075444)dis+11_61:31_drc=ordering:lsd=5:bsr=unit_only:rp=on:newcnf=on:random_seed=1964127069:i=135531:add=off:rawr=on_2999 on theBenchmark for (2999ds/135531Mi)
% 0.18/0.27  % (1075445)dis+10_161_sil=256000:plsq=on:plsqr=61199697,1048576:gs=on:alpa=true:sac=on:slsq=on:cn=on:random_seed=3924223488:i=88024:add=on:rawr=on_2999 on theBenchmark for (2999ds/88024Mi)
% 0.18/0.27  % (1075446)dis+10_1_sil=32000:sp=arity:random_seed=576105591:i=103:fgj=on_2999 on theBenchmark for (2999ds/103Mi)
% 0.18/0.27  % (1075447)ott+31_1_sil=16000:lcm=predicate:bce=on:newcnf=on:random_seed=3077584524:i=116_2999 on theBenchmark for (2999ds/116Mi)
% 0.18/0.27  % (1075444)WARNING: Not using 'newcnf' as currently not compatible with higher-order inputs.
% 0.18/0.27  % (1075450)ott-3_16_to=lpo:sil=16000:sp=arity:fd=off:rp=on:random_seed=3580204592:i=159:bs=unit_only:nicw=on:fsr=off:amm=off_2999 on theBenchmark for (2999ds/159Mi)
% 0.18/0.27  % (1075449)ott+1_1_to=lpo:sil=16000:sp=reverse_arity:erd=off:random_seed=2195337630:i=131_2999 on theBenchmark for (2999ds/131Mi)
% 0.18/0.27  % (1075444)WARNING: Look ahead literal selection is not currently compatible with higher-order. Ignoring request to use
% 0.18/0.27  % (1075447)WARNING: Not using 'newcnf' as currently not compatible with higher-order inputs.
% 0.18/0.27  % (1075458)fmb+10_1_fmbas=predicate:sil=64000:sas=cadical:random_seed=1509838891:i=714:nm=2_2999 on theBenchmark for (2999ds/714Mi)
% 0.18/0.27  % Exception at run slice level
% 0.18/0.27  User error: Finite model building is currently not compatible with polymorphism or higher-order constructs
% 0.18/0.27  % (1075447) found proof, printing to "/export/starexec/sandbox2/tmp/vampire-proof-1075423-1075447"...
% 0.18/0.27  % (1075446) found proof, printing to "/export/starexec/sandbox2/tmp/vampire-proof-1075423-1075446"...
% 0.18/0.27  % (1075444) found proof, printing to "/export/starexec/sandbox2/tmp/vampire-proof-1075423-1075444"...
% 0.18/0.27  % (1075445) found proof, printing to "/export/starexec/sandbox2/tmp/vampire-proof-1075423-1075445"...
% 0.18/0.27  % (1075447)...printing done.
% 0.18/0.27  % (1075446)...printing done.
% 0.18/0.27  % (1075444)...printing done.
% 0.18/0.27  % (1075447)Refutation found. Thanks to Tanya!
% 0.18/0.27  % SZS status Theorem for theBenchmark
% 0.18/0.27  % SZS output start Proof for theBenchmark
% See solution above
% 0.18/0.27  % (1075447)------------------------------
% 0.18/0.27  % (1075447)Version: Vampire 5.0.1 (Release build, commit 5ef7c2677 on 2026-07-16 16:54:09 +0200)
% 0.18/0.27  % (1075447)Linked with Z3 4.14.0.0 3c47fd96cf5645d0c42b2c819d9e9a84380aa721 z3-4.8.4-9178-g3c47fd96c
% 0.18/0.27  % (1075447)CaDiCaL version: 2.1.3
% 0.18/0.27  % (1075447)Termination reason: Refutation
% 0.18/0.27  % (1075447)Time elapsed: 0.004 s
% 0.18/0.27  % (1075447)Peak memory usage: 12 MB
% 0.18/0.27  % (1075447)Instructions burned: 5 (million)
% 0.18/0.27  % (1075423)Success in time 0.042 s
% 0.18/0.27  % Vampire exiting
%------------------------------------------------------------------------------