TSTP Solution File: SYO009^1 by Vampire---4.8

View Problem - Process Solution

%------------------------------------------------------------------------------
% File     : Vampire---4.8
% Problem  : SYO009^1 : TPTP v8.2.0. Released v3.7.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/sandbox/solver/bin/quickGreedyProduceRating_steal_pow3.txt --cores 8 -m 12000 -t %d %s

% Computer : n025.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 09:02:12 EDT 2024

% Result   : Theorem 0.10s 0.30s
% Output   : Refutation 0.10s
% Verified : 
% SZS Type : Refutation
%            Derivation depth      :    8
%            Number of leaves      :    3
% Syntax   : Number of formulae    :   11 (   6 unt;   2 typ;   0 def)
%            Number of atoms       :   25 (   5 equ;   0 cnn)
%            Maximal formula atoms :    2 (   2 avg)
%            Number of connectives :   29 (   6   ~;   0   |;   0   &;  17   @)
%                                         (   0 <=>;   6  =>;   0  <=;   0 <~>)
%            Maximal formula depth :    6 (   3 avg)
%            Number of types       :    2 (   0 usr)
%            Number of type conns  :    3 (   3   >;   0   *;   0   +;   0  <<)
%            Number of symbols     :    5 (   2 usr;   2 con; 0-2 aty)
%            Number of variables   :    5 (   5   ^   0   !;   0   ?;   5   :)

% Comments : 
%------------------------------------------------------------------------------
thf(func_def_0,type,
    p: ( $i > $i ) > $o ).

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

thf(f10,plain,
    $false,
    inference(trivial_inequality_removal,[],[f9]) ).

thf(f9,plain,
    $true = $false,
    inference(boolean_simplification,[],[f8]) ).

thf(f8,plain,
    ( ~ $true = $true ),
    inference(boolean_simplification,[],[f7]) ).

thf(f7,plain,
    ( $true
    = ( ~ ( ( p @ f )
         => ( p @ f ) ) ) ),
    inference(beta_eta_normalization,[],[f6]) ).

thf(f6,plain,
    ( $true
    = ( ~ ( ( p
            @ ^ [Y0: $i] : ( f @ Y0 ) )
         => ( p @ f ) ) ) ),
    inference(cnf_transformation,[],[f5]) ).

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

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

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

thf(f1,conjecture,
    ( ( p
      @ ^ [X0: $i] : ( f @ X0 ) )
   => ( p @ f ) ),
    file('/export/starexec/sandbox/benchmark/theBenchmark.p',conj) ).

%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.04/0.08  % Problem    : SYO009^1 : TPTP v8.2.0. Released v3.7.0.
% 0.04/0.09  % Command    : vampire --input_syntax tptp --proof tptp --output_axiom_names on --mode portfolio --schedule file --schedule_file /export/starexec/sandbox/solver/bin/quickGreedyProduceRating_steal_pow3.txt --cores 8 -m 12000 -t %d %s
% 0.10/0.28  % Computer : n025.cluster.edu
% 0.10/0.28  % Model    : x86_64 x86_64
% 0.10/0.28  % CPU      : Intel(R) Xeon(R) CPU E5-2620 v4 @ 2.10GHz
% 0.10/0.28  % Memory   : 8042.1875MB
% 0.10/0.28  % OS       : Linux 3.10.0-693.el7.x86_64
% 0.10/0.28  % CPULimit   : 300
% 0.10/0.28  % WCLimit    : 300
% 0.10/0.28  % DateTime   : Mon May 20 09:07:52 EDT 2024
% 0.10/0.28  % CPUTime    : 
% 0.10/0.28  This is a TH0_THM_NEQ_NAR problem
% 0.10/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/sandbox/benchmark/theBenchmark.p
% 0.10/0.29  % (25620)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.10/0.29  % (25622)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.10/0.29  % (25623)lrs+10_1:1_au=on:inj=on:i=2:si=on:rtra=on_0 on theBenchmark for (3000ds/2Mi)
% 0.10/0.29  % (25624)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.10/0.29  % (25625)lrs+1002_1:1_au=on:bd=off:e2e=on:sd=2:sos=on:ss=axioms:i=275:si=on:rtra=on_0 on theBenchmark for (3000ds/275Mi)
% 0.10/0.29  % (25626)lrs+1004_1:128_cond=on:e2e=on:sp=weighted_frequency:i=18:si=on:rtra=on_0 on theBenchmark for (3000ds/18Mi)
% 0.10/0.29  % (25627)lrs+10_1:1_bet=on:cnfonf=off:fd=off:hud=5:inj=on:i=3:si=on:rtra=on_0 on theBenchmark for (3000ds/3Mi)
% 0.10/0.29  % (25624)First to succeed.
% 0.10/0.29  % (25620)Also succeeded, but the first one will report.
% 0.10/0.29  % (25622)Also succeeded, but the first one will report.
% 0.10/0.30  % (25624)Refutation found. Thanks to Tanya!
% 0.10/0.30  % SZS status Theorem for theBenchmark
% 0.10/0.30  % SZS output start Proof for theBenchmark
% See solution above
% 0.10/0.30  % (25624)------------------------------
% 0.10/0.30  % (25624)Version: Vampire 4.8 HO - Sledgehammer schedules (2023-10-19)
% 0.10/0.30  % (25624)Termination reason: Refutation
% 0.10/0.30  
% 0.10/0.30  % (25624)Memory used [KB]: 5373
% 0.10/0.30  % (25624)Time elapsed: 0.002 s
% 0.10/0.30  % (25624)Instructions burned: 1 (million)
% 0.10/0.30  % (25624)------------------------------
% 0.10/0.30  % (25624)------------------------------
% 0.10/0.30  % (25619)Success in time 0.009 s
% 0.10/0.30  % Vampire---4.8 exiting
%------------------------------------------------------------------------------