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

View Problem - Process Solution

%------------------------------------------------------------------------------
% File     : Vampire---4.8
% Problem  : SYO230^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/sandbox/solver/bin/quickGreedyProduceRating_steal_pow3.txt --cores 8 -m 12000 -t %d %s

% Computer : n010.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:03:35 EDT 2024

% Result   : Theorem 0.16s 0.32s
% Output   : Refutation 0.16s
% Verified : 
% SZS Type : Refutation
%            Derivation depth      :    6
%            Number of leaves      :    3
% Syntax   : Number of formulae    :    9 (   7 unt;   2 typ;   0 def)
%            Number of atoms       :   40 (   6 equ)
%            Maximal formula atoms :    1 (   5 avg)
%            Number of connectives :    8 (   5   ~;   3   |;   0   &)
%                                         (   0 <=>;   0  =>;   0  <=;   0 <~>)
%            Maximal formula depth :    3 (   3 avg)
%            Maximal term depth    :    1 (   1 avg)
%            Number of FOOLs       :   30 (  30 fml;   0 var)
%            Number of types       :    2 (   0 usr)
%            Number of type conns  :    0 (   0   >;   0   *;   0   +;   0  <<)
%            Number of predicates  :    7 (   5 usr;   2 prp; 0-4 aty)
%            Number of functors    :    2 (   2 usr;   2 con; 0-0 aty)
%            Number of variables   :    9 (   2   !;   4   ?;   9   :)

% Comments : 
%------------------------------------------------------------------------------
tff(func_def_0,type,
    cB: sTfun($i,$o) ).

tff(func_def_1,type,
    cA: sTfun($i,$o) ).

tff(f8,plain,
    $false,
    inference(equality_resolution,[],[f7]) ).

tff(f7,plain,
    ! [X0: sTfun($i,$o)] : ( vLAM($i,$o,vAPP($o,$o,vAPP($o,sTfun($o,$o),vOR,vAPP($i,$o,cB,db0($i))),vAPP($i,$o,cA,db0($i)))) != X0 ),
    inference(cnf_transformation,[],[f6]) ).

tff(f6,plain,
    ! [X0: sTfun($i,$o)] : ( vLAM($i,$o,vAPP($o,$o,vAPP($o,sTfun($o,$o),vOR,vAPP($i,$o,cB,db0($i))),vAPP($i,$o,cA,db0($i)))) != X0 ),
    inference(ennf_transformation,[],[f5]) ).

tff(f5,plain,
    ~ ? [X0: sTfun($i,$o)] : ( vLAM($i,$o,vAPP($o,$o,vAPP($o,sTfun($o,$o),vOR,vAPP($i,$o,cB,db0($i))),vAPP($i,$o,cA,db0($i)))) = X0 ),
    inference(fool_elimination,[],[f4]) ).

tff(f4,plain,
    ~ ? [X0: sTfun($i,$o)] :
        ( X0
        = ( ^ [X1: $i] :
              ( vAPP($i,$o,cA,X1)
              | vAPP($i,$o,cB,X1) ) ) ),
    inference(rectify,[],[f2]) ).

tff(f2,negated_conjecture,
    ~ ? [X0: sTfun($i,$o)] :
        ( X0
        = ( ^ [X1: $i] :
              ( vAPP($i,$o,cA,X1)
              | vAPP($i,$o,cB,X1) ) ) ),
    inference(negated_conjecture,[],[f1]) ).

tff(f1,conjecture,
    ? [X0: sTfun($i,$o)] :
      ( X0
      = ( ^ [X1: $i] :
            ( vAPP($i,$o,cA,X1)
            | vAPP($i,$o,cB,X1) ) ) ),
    file('/export/starexec/sandbox/benchmark/theBenchmark.p',cSV2) ).

%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.00/0.09  % Problem    : SYO230^5 : TPTP v8.2.0. Released v4.0.0.
% 0.00/0.11  % 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.31  % Computer : n010.cluster.edu
% 0.10/0.31  % Model    : x86_64 x86_64
% 0.10/0.31  % CPU      : Intel(R) Xeon(R) CPU E5-2620 v4 @ 2.10GHz
% 0.10/0.31  % Memory   : 8042.1875MB
% 0.10/0.31  % OS       : Linux 3.10.0-693.el7.x86_64
% 0.10/0.31  % CPULimit   : 300
% 0.10/0.31  % WCLimit    : 300
% 0.10/0.31  % DateTime   : Mon May 20 09:55:08 EDT 2024
% 0.10/0.31  % CPUTime    : 
% 0.10/0.31  This is a TH0_THM_EQU_NAR problem
% 0.10/0.31  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.16/0.32  % (32351)lrs+10_1:1_au=on:inj=on:i=2:si=on:rtra=on_0 on theBenchmark for (3000ds/2Mi)
% 0.16/0.32  % (32348)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.16/0.32  % (32351)First to succeed.
% 0.16/0.32  % (32348)Also succeeded, but the first one will report.
% 0.16/0.32  % (32349)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.16/0.32  % (32351)Refutation found. Thanks to Tanya!
% 0.16/0.32  % SZS status Theorem for theBenchmark
% 0.16/0.32  % SZS output start Proof for theBenchmark
% See solution above
% 0.16/0.32  % (32351)------------------------------
% 0.16/0.32  % (32351)Version: Vampire 4.8 HO - Sledgehammer schedules (2023-10-19)
% 0.16/0.32  % (32351)Termination reason: Refutation
% 0.16/0.32  
% 0.16/0.32  % (32351)Memory used [KB]: 5373
% 0.16/0.32  % (32351)Time elapsed: 0.002 s
% 0.16/0.32  % (32351)Instructions burned: 1 (million)
% 0.16/0.32  % (32351)------------------------------
% 0.16/0.32  % (32351)------------------------------
% 0.16/0.32  % (32347)Success in time 0.009 s
% 0.16/0.32  % Vampire---4.8 exiting
%------------------------------------------------------------------------------