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

View Problem - Process Solution

%------------------------------------------------------------------------------
% File     : Vampire---4.8
% Problem  : SYO507^1 : TPTP v8.2.0. Released v4.1.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 09:05:35 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    :   12 (   5 unt;   2 typ;   0 def)
%            Number of atoms       :   45 (   8 equ;   0 cnn)
%            Maximal formula atoms :    4 (   4 avg)
%            Number of connectives :   53 (  27   ~;   0   |;   5   &;  21   @)
%                                         (   0 <=>;   0  =>;   0  <=;   0 <~>)
%            Maximal formula depth :   10 (   5 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   :    7 (   7   ^   0   !;   0   ?;   7   :)

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

thf(func_def_1,type,
    p: ( $i > $o ) > $o ).

thf(f11,plain,
    $false,
    inference(subsumption_resolution,[],[f8,f10]) ).

thf(f10,plain,
    ( ( p @ f )
   != $true ),
    inference(beta_eta_normalization,[],[f9]) ).

thf(f9,plain,
    ( ( p
      @ ^ [Y0: $i] : ( f @ Y0 ) )
   != $true ),
    inference(boolean_simplification,[],[f7]) ).

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

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

thf(f5,plain,
    ~ ~ ( ( ( p
            @ ^ [Y0: $i] :
                ~ ~ ( f @ Y0 ) )
         != $true )
        & ( ( p @ f )
          = $true ) ),
    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/sandbox2/benchmark/theBenchmark.p',claim) ).

thf(f8,plain,
    ( ( p @ f )
    = $true ),
    inference(cnf_transformation,[],[f6]) ).

%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.03/0.09  % Problem    : SYO507^1 : TPTP v8.2.0. Released v4.1.0.
% 0.03/0.10  % 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.10/0.29  % Computer : n032.cluster.edu
% 0.10/0.29  % Model    : x86_64 x86_64
% 0.10/0.29  % CPU      : Intel(R) Xeon(R) CPU E5-2620 v4 @ 2.10GHz
% 0.10/0.29  % Memory   : 8042.1875MB
% 0.10/0.29  % OS       : Linux 3.10.0-693.el7.x86_64
% 0.10/0.29  % CPULimit   : 300
% 0.10/0.29  % WCLimit    : 300
% 0.10/0.29  % DateTime   : Mon May 20 10:23:22 EDT 2024
% 0.10/0.29  % CPUTime    : 
% 0.10/0.29  This is a TH0_THM_NEQ_NAR problem
% 0.10/0.29  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.10/0.30  % (4170)lrs+10_1:1_au=on:inj=on:i=2:si=on:rtra=on_0 on theBenchmark for (3000ds/2Mi)
% 0.10/0.30  % (4170)First to succeed.
% 0.10/0.30  % (4170)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  % (4170)------------------------------
% 0.10/0.30  % (4170)Version: Vampire 4.8 HO - Sledgehammer schedules (2023-10-19)
% 0.10/0.30  % (4170)Termination reason: Refutation
% 0.10/0.30  
% 0.10/0.30  % (4170)Memory used [KB]: 5373
% 0.10/0.30  % (4170)Time elapsed: 0.002 s
% 0.10/0.30  % (4170)------------------------------
% 0.10/0.30  % (4170)------------------------------
% 0.10/0.30  % (4166)Success in time 0.009 s
% 0.10/0.31  % Vampire---4.8 exiting
%------------------------------------------------------------------------------