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

View Problem - Process Solution

%------------------------------------------------------------------------------
% File     : Vampire---4.8
% Problem  : SYO125^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 : n029.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:01 EDT 2024

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

% Comments : 
%------------------------------------------------------------------------------
tff(f13,plain,
    $false,
    inference(trivial_inequality_removal,[],[f12]) ).

tff(f12,plain,
    cR != cR,
    inference(definition_unfolding,[],[f10,f11]) ).

tff(f11,plain,
    cP = cR,
    inference(definition_unfolding,[],[f9,f8]) ).

tff(f8,plain,
    cQ = cR,
    inference(cnf_transformation,[],[f7]) ).

tff(f7,plain,
    ( ( cP != cR )
    & ( cP = cQ )
    & ( cQ = cR ) ),
    inference(flattening,[],[f6]) ).

tff(f6,plain,
    ( ( cP != cR )
    & ( cP = cQ )
    & ( cQ = cR ) ),
    inference(ennf_transformation,[],[f5]) ).

tff(f5,plain,
    ~ ( ( ( cP = cQ )
        & ( cQ = cR ) )
     => ( cP = cR ) ),
    inference(fool_elimination,[],[f4]) ).

tff(f4,plain,
    ~ ( ( ( cP
        <=> cQ )
        & ( cQ
        <=> cR ) )
     => ( cR
      <=> cP ) ),
    inference(rectify,[],[f2]) ).

tff(f2,negated_conjecture,
    ~ ( ( ( cP
        <=> cQ )
        & ( cQ
        <=> cR ) )
     => ( cR
      <=> cP ) ),
    inference(negated_conjecture,[],[f1]) ).

tff(f1,conjecture,
    ( ( ( cP
      <=> cQ )
      & ( cQ
      <=> cR ) )
   => ( cR
    <=> cP ) ),
    file('/export/starexec/sandbox2/benchmark/theBenchmark.p',cTRIV4) ).

tff(f9,plain,
    cP = cQ,
    inference(cnf_transformation,[],[f7]) ).

tff(f10,plain,
    cP != cR,
    inference(cnf_transformation,[],[f7]) ).

%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.03/0.12  % Problem    : SYO125^5 : TPTP v8.2.0. Released v4.0.0.
% 0.13/0.14  % 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.14/0.35  % Computer : n029.cluster.edu
% 0.14/0.35  % Model    : x86_64 x86_64
% 0.14/0.35  % CPU      : Intel(R) Xeon(R) CPU E5-2620 v4 @ 2.10GHz
% 0.14/0.35  % Memory   : 8042.1875MB
% 0.14/0.35  % OS       : Linux 3.10.0-693.el7.x86_64
% 0.14/0.35  % CPULimit   : 300
% 0.14/0.35  % WCLimit    : 300
% 0.14/0.35  % DateTime   : Mon May 20 08:56:23 EDT 2024
% 0.14/0.35  % CPUTime    : 
% 0.14/0.35  This is a TH0_THM_NEQ_NAR problem
% 0.20/0.36  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.20/0.38  % (9150)lrs+10_1:1_au=on:inj=on:i=2:si=on:rtra=on_0 on theBenchmark for (3000ds/2Mi)
% 0.20/0.38  % (9148)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.20/0.38  % (9152)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.20/0.38  % (9147)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.20/0.38  % (9154)lrs+1004_1:128_cond=on:e2e=on:sp=weighted_frequency:i=18:si=on:rtra=on_0 on theBenchmark for (3000ds/18Mi)
% 0.20/0.38  % (9153)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.20/0.38  % (9148)First to succeed.
% 0.20/0.38  % (9150)Also succeeded, but the first one will report.
% 0.20/0.38  % (9155)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.20/0.38  % (9147)Also succeeded, but the first one will report.
% 0.20/0.38  % (9148)Refutation found. Thanks to Tanya!
% 0.20/0.38  % SZS status Theorem for theBenchmark
% 0.20/0.38  % SZS output start Proof for theBenchmark
% See solution above
% 0.20/0.38  % (9148)------------------------------
% 0.20/0.38  % (9148)Version: Vampire 4.8 HO - Sledgehammer schedules (2023-10-19)
% 0.20/0.38  % (9148)Termination reason: Refutation
% 0.20/0.38  
% 0.20/0.38  % (9148)Memory used [KB]: 5373
% 0.20/0.38  % (9148)Time elapsed: 0.002 s
% 0.20/0.38  % (9148)Instructions burned: 1 (million)
% 0.20/0.38  % (9148)------------------------------
% 0.20/0.38  % (9148)------------------------------
% 0.20/0.38  % (9143)Success in time 0.007 s
% 0.20/0.38  % Vampire---4.8 exiting
%------------------------------------------------------------------------------