TSTP Solution File: SEU919^5 by Vampire---4.8

View Problem - Process Solution

%------------------------------------------------------------------------------
% File     : Vampire---4.8
% Problem  : SEU919^5 : TPTP v8.2.0. Released v4.0.0.
% Transfm  : none
% Format   : tptp:raw
% Command  : vampire --input_syntax tptp --proof tptp --output_axiom_names on --mode portfolio --schedule file --schedule_file /export/starexec/sandbox2/solver/bin/quickGreedyProduceRating_steal_pow3.txt --cores 8 -m 12000 -t %d %s

% Computer : n032.cluster.edu
% Model    : x86_64 x86_64
% CPU      : Intel(R) Xeon(R) CPU E5-2620 v4 2.10GHz
% Memory   : 8042.1875MB
% OS       : Linux 3.10.0-693.el7.x86_64
% CPULimit : 300s
% WCLimit  : 300s
% DateTime : Tue May 21 03:52:12 EDT 2024

% Result   : Theorem 0.08s 0.29s
% Output   : Refutation 0.08s
% Verified : 
% SZS Type : Refutation
%            Derivation depth      :   10
%            Number of leaves      :    5
% Syntax   : Number of formulae    :   17 (   7 unt;   4 typ;   0 def)
%            Number of atoms       :   58 (  18 equ;   0 cnn)
%            Maximal formula atoms :    5 (   4 avg)
%            Number of connectives :  102 (   7   ~;   0   |;   4   &;  83   @)
%                                         (   0 <=>;   8  =>;   0  <=;   0 <~>)
%            Maximal formula depth :    7 (   3 avg)
%            Number of types       :    2 (   0 usr)
%            Number of type conns  :    3 (   3   >;   0   *;   0   +;   0  <<)
%            Number of symbols     :    8 (   5 usr;   3 con; 0-2 aty)
%            Number of variables   :   19 (  16   ^   2   !;   0   ?;  19   :)
%                                         (   1  !>;   0  ?*;   0  @-;   0  @+)

% Comments : 
%------------------------------------------------------------------------------
thf(func_def_1,type,
    f: $i > $i ).

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

thf(func_def_3,type,
    cP: $i > $o ).

thf(func_def_10,type,
    ph1: 
      !>[X0: $tType] : X0 ).

thf(f14,plain,
    $false,
    inference(subsumption_resolution,[],[f13,f8]) ).

thf(f8,plain,
    ( ( cP @ ( f @ ( g @ a ) ) )
    = $true ),
    inference(cnf_transformation,[],[f7]) ).

thf(f7,plain,
    ( ( ( ^ [Y0: $i] : ( f @ ( g @ Y0 ) ) )
      = ( ^ [Y0: $i] : ( g @ ( f @ Y0 ) ) ) )
    & ( ( cP @ ( g @ ( f @ a ) ) )
     != $true )
    & ( ( cP @ ( f @ ( g @ a ) ) )
      = $true ) ),
    inference(flattening,[],[f6]) ).

thf(f6,plain,
    ( ( ( cP @ ( g @ ( f @ a ) ) )
     != $true )
    & ( ( cP @ ( f @ ( g @ a ) ) )
      = $true )
    & ( ( ^ [Y0: $i] : ( f @ ( g @ Y0 ) ) )
      = ( ^ [Y0: $i] : ( g @ ( f @ Y0 ) ) ) ) ),
    inference(ennf_transformation,[],[f5]) ).

thf(f5,plain,
    ~ ( ( ( ^ [Y0: $i] : ( f @ ( g @ Y0 ) ) )
        = ( ^ [Y0: $i] : ( g @ ( f @ Y0 ) ) ) )
     => ( ( ( cP @ ( f @ ( g @ a ) ) )
          = $true )
       => ( ( cP @ ( g @ ( f @ a ) ) )
          = $true ) ) ),
    inference(fool_elimination,[],[f4]) ).

thf(f4,plain,
    ~ ( ( ( ^ [X0: $i] : ( g @ ( f @ X0 ) ) )
        = ( ^ [X1: $i] : ( f @ ( g @ X1 ) ) ) )
     => ( ( cP @ ( f @ ( g @ a ) ) )
       => ( cP @ ( g @ ( f @ a ) ) ) ) ),
    inference(rectify,[],[f2]) ).

thf(f2,negated_conjecture,
    ~ ( ( ( ^ [X0: $i] : ( g @ ( f @ X0 ) ) )
        = ( ^ [X0: $i] : ( f @ ( g @ X0 ) ) ) )
     => ( ( cP @ ( f @ ( g @ a ) ) )
       => ( cP @ ( g @ ( f @ a ) ) ) ) ),
    inference(negated_conjecture,[],[f1]) ).

thf(f1,conjecture,
    ( ( ( ^ [X0: $i] : ( g @ ( f @ X0 ) ) )
      = ( ^ [X0: $i] : ( f @ ( g @ X0 ) ) ) )
   => ( ( cP @ ( f @ ( g @ a ) ) )
     => ( cP @ ( g @ ( f @ a ) ) ) ) ),
    file('/export/starexec/sandbox2/benchmark/theBenchmark.p',cTHM127_pme) ).

thf(f13,plain,
    ( ( cP @ ( f @ ( g @ a ) ) )
   != $true ),
    inference(backward_demodulation,[],[f9,f12]) ).

thf(f12,plain,
    ! [X1: $i] :
      ( ( g @ ( f @ X1 ) )
      = ( f @ ( g @ X1 ) ) ),
    inference(beta_eta_normalization,[],[f11]) ).

thf(f11,plain,
    ! [X1: $i] :
      ( ( ^ [Y0: $i] : ( f @ ( g @ Y0 ) )
        @ X1 )
      = ( ^ [Y0: $i] : ( g @ ( f @ Y0 ) )
        @ X1 ) ),
    inference(argument_congruence,[],[f10]) ).

thf(f10,plain,
    ( ( ^ [Y0: $i] : ( f @ ( g @ Y0 ) ) )
    = ( ^ [Y0: $i] : ( g @ ( f @ Y0 ) ) ) ),
    inference(cnf_transformation,[],[f7]) ).

thf(f9,plain,
    ( ( cP @ ( g @ ( f @ a ) ) )
   != $true ),
    inference(cnf_transformation,[],[f7]) ).

%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.00/0.08  % Problem    : SEU919^5 : TPTP v8.2.0. Released v4.0.0.
% 0.00/0.09  % Command    : vampire --input_syntax tptp --proof tptp --output_axiom_names on --mode portfolio --schedule file --schedule_file /export/starexec/sandbox2/solver/bin/quickGreedyProduceRating_steal_pow3.txt --cores 8 -m 12000 -t %d %s
% 0.08/0.28  % Computer : n032.cluster.edu
% 0.08/0.28  % Model    : x86_64 x86_64
% 0.08/0.28  % CPU      : Intel(R) Xeon(R) CPU E5-2620 v4 @ 2.10GHz
% 0.08/0.28  % Memory   : 8042.1875MB
% 0.08/0.28  % OS       : Linux 3.10.0-693.el7.x86_64
% 0.08/0.28  % CPULimit   : 300
% 0.08/0.28  % WCLimit    : 300
% 0.08/0.28  % DateTime   : Sun May 19 17:12:38 EDT 2024
% 0.08/0.28  % CPUTime    : 
% 0.08/0.28  This is a TH0_THM_EQU_NAR problem
% 0.08/0.28  Running vampire_ho --input_syntax tptp --proof tptp --output_axiom_names on --mode portfolio --schedule snake_tptp_hol --cores 8 -m 12000 -t 300 /export/starexec/sandbox2/benchmark/theBenchmark.p
% 0.08/0.29  % (2427)lrs+10_1:1_c=on:cnfonf=conj_eager:fd=off:fe=off:kws=frequency:spb=intro:i=4:si=on:rtra=on_0 on theBenchmark for (3000ds/4Mi)
% 0.08/0.29  % (2428)dis+1010_1:1_au=on:cbe=off:chr=on:fsr=off:hfsq=on:nm=64:sos=theory:sp=weighted_frequency:i=27:si=on:rtra=on_0 on theBenchmark for (3000ds/27Mi)
% 0.08/0.29  % (2430)lrs+10_1:1_au=on:inj=on:i=2:si=on:rtra=on_0 on theBenchmark for (3000ds/2Mi)
% 0.08/0.29  % (2433)lrs+1004_1:128_cond=on:e2e=on:sp=weighted_frequency:i=18:si=on:rtra=on_0 on theBenchmark for (3000ds/18Mi)
% 0.08/0.29  % (2426)lrs+1002_1:8_bd=off:fd=off:hud=10:tnu=1:i=183:si=on:rtra=on_0 on theBenchmark for (3000ds/183Mi)
% 0.08/0.29  % (2431)lrs+1002_1:128_aac=none:au=on:cnfonf=lazy_not_gen_be_off:sos=all:i=2:si=on:rtra=on_0 on theBenchmark for (3000ds/2Mi)
% 0.08/0.29  % (2430)First to succeed.
% 0.08/0.29  % (2431)Instruction limit reached!
% 0.08/0.29  % (2431)------------------------------
% 0.08/0.29  % (2431)Version: Vampire 4.8 HO - Sledgehammer schedules (2023-10-19)
% 0.08/0.29  % (2431)Termination reason: Unknown
% 0.08/0.29  % (2431)Termination phase: Saturation
% 0.08/0.29  
% 0.08/0.29  % (2431)Memory used [KB]: 5500
% 0.08/0.29  % (2431)Time elapsed: 0.002 s
% 0.08/0.29  % (2431)Instructions burned: 2 (million)
% 0.08/0.29  % (2431)------------------------------
% 0.08/0.29  % (2431)------------------------------
% 0.08/0.29  % (2427)Also succeeded, but the first one will report.
% 0.08/0.29  % (2428)Also succeeded, but the first one will report.
% 0.08/0.29  % (2430)Refutation found. Thanks to Tanya!
% 0.08/0.29  % SZS status Theorem for theBenchmark
% 0.08/0.29  % SZS output start Proof for theBenchmark
% See solution above
% 0.08/0.29  % (2430)------------------------------
% 0.08/0.29  % (2430)Version: Vampire 4.8 HO - Sledgehammer schedules (2023-10-19)
% 0.08/0.29  % (2430)Termination reason: Refutation
% 0.08/0.29  
% 0.08/0.29  % (2430)Memory used [KB]: 5500
% 0.08/0.29  % (2430)Time elapsed: 0.003 s
% 0.08/0.29  % (2430)Instructions burned: 1 (million)
% 0.08/0.29  % (2430)------------------------------
% 0.08/0.29  % (2430)------------------------------
% 0.08/0.29  % (2422)Success in time 0.003 s
% 0.08/0.30  % Vampire---4.8 exiting
%------------------------------------------------------------------------------