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

View Problem - Process Solution

%------------------------------------------------------------------------------
% File     : Vampire---4.8
% Problem  : SYO087^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 : n006.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:53 EDT 2024

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

% Comments : 
%------------------------------------------------------------------------------
tff(f22,plain,
    $false,
    inference(subsumption_resolution,[],[f10,f21]) ).

tff(f21,plain,
    cP = $true,
    inference(subsumption_resolution,[],[f12,f20]) ).

tff(f20,plain,
    cQ = $true,
    inference(subsumption_resolution,[],[f18,f11]) ).

tff(f11,plain,
    cR != $true,
    inference(cnf_transformation,[],[f9]) ).

tff(f9,plain,
    ( ( ( ( cQ = $true )
        & ( cR != $true ) )
      | ( ( cQ != $true )
        & ( cR = $true ) ) )
    & ( ( ( cP != $true )
        & ( cQ != $true ) )
      | ( ( cQ = $true )
        & ( cP = $true ) ) )
    & ( cR != $true )
    & ( cP != $true ) ),
    inference(flattening,[],[f8]) ).

tff(f8,plain,
    ( ( cR != $true )
    & ( ( ( cP != $true )
        & ( cQ != $true ) )
      | ( ( cQ = $true )
        & ( cP = $true ) ) )
    & ( ( ( cQ = $true )
        & ( cR != $true ) )
      | ( ( cQ != $true )
        & ( cR = $true ) ) )
    & ( cP != $true ) ),
    inference(ennf_transformation,[],[f7]) ).

tff(f7,plain,
    ~ ( ( ( ( ( cQ = $true )
            & ( cR != $true ) )
          | ( ( cQ != $true )
            & ( cR = $true ) ) )
        & ( cP != $true ) )
     => ( ( ( ( cP != $true )
            & ( cQ != $true ) )
          | ( ( cQ = $true )
            & ( cP = $true ) ) )
       => ( cR = $true ) ) ),
    inference(flattening,[],[f6]) ).

tff(f6,plain,
    ~ ( ( ( ( ( cQ != $true )
            & ( cR = $true ) )
          | ( ( cQ = $true )
            & ( cR != $true ) ) )
        & ( cP != $true ) )
     => ( ( ( ( cQ = $true )
            & ( cP = $true ) )
          | ( ( cP != $true )
            & ( cQ != $true ) ) )
       => ( cR = $true ) ) ),
    inference(fool_elimination,[],[f5]) ).

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

tff(f2,negated_conjecture,
    ~ ? [X0] :
        ( ( ( ( ~ cQ
              & cR )
            | ( cQ
              & ~ cR ) )
          & ~ cP )
       => ( ( ( cQ
              & cP )
            | ( ~ cP
              & ~ cQ ) )
         => cR ) ),
    inference(negated_conjecture,[],[f1]) ).

tff(f1,conjecture,
    ? [X0] :
      ( ( ( ( ~ cQ
            & cR )
          | ( cQ
            & ~ cR ) )
        & ~ cP )
     => ( ( ( cQ
            & cP )
          | ( ~ cP
            & ~ cQ ) )
       => cR ) ),
    file('/export/starexec/sandbox2/benchmark/theBenchmark.p',cTHM50_13) ).

tff(f18,plain,
    ( ( cR = $true )
    | ( cQ = $true ) ),
    inference(cnf_transformation,[],[f9]) ).

tff(f12,plain,
    ( ( cP = $true )
    | ( cQ != $true ) ),
    inference(cnf_transformation,[],[f9]) ).

tff(f10,plain,
    cP != $true,
    inference(cnf_transformation,[],[f9]) ).

%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.06/0.11  % Problem    : SYO087^5 : TPTP v8.2.0. Released v4.0.0.
% 0.06/0.13  % 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.12/0.34  % Computer : n006.cluster.edu
% 0.12/0.34  % Model    : x86_64 x86_64
% 0.12/0.34  % CPU      : Intel(R) Xeon(R) CPU E5-2620 v4 @ 2.10GHz
% 0.12/0.34  % Memory   : 8042.1875MB
% 0.12/0.34  % OS       : Linux 3.10.0-693.el7.x86_64
% 0.12/0.34  % CPULimit   : 300
% 0.12/0.34  % WCLimit    : 300
% 0.12/0.34  % DateTime   : Mon May 20 10:00:38 EDT 2024
% 0.12/0.34  % CPUTime    : 
% 0.12/0.34  This is a TH0_THM_NEQ_NAR problem
% 0.12/0.34  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.12/0.36  % (21881)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.12/0.36  % (21879)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.12/0.36  % (21880)lrs+10_1:1_au=on:inj=on:i=2:si=on:rtra=on_0 on theBenchmark for (3000ds/2Mi)
% 0.12/0.36  % (21877)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.12/0.36  % (21877)First to succeed.
% 0.12/0.36  % (21884)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.12/0.36  % (21878)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.12/0.36  % (21880)Also succeeded, but the first one will report.
% 0.12/0.36  % (21882)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.12/0.36  % (21883)lrs+1004_1:128_cond=on:e2e=on:sp=weighted_frequency:i=18:si=on:rtra=on_0 on theBenchmark for (3000ds/18Mi)
% 0.12/0.36  % (21879)Also succeeded, but the first one will report.
% 0.12/0.36  % (21877)Refutation found. Thanks to Tanya!
% 0.12/0.36  % SZS status Theorem for theBenchmark
% 0.12/0.36  % SZS output start Proof for theBenchmark
% See solution above
% 0.12/0.36  % (21877)------------------------------
% 0.12/0.36  % (21877)Version: Vampire 4.8 HO - Sledgehammer schedules (2023-10-19)
% 0.12/0.36  % (21877)Termination reason: Refutation
% 0.12/0.36  
% 0.12/0.36  % (21877)Memory used [KB]: 5373
% 0.12/0.36  % (21877)Time elapsed: 0.002 s
% 0.12/0.36  % (21877)Instructions burned: 1 (million)
% 0.12/0.36  % (21877)------------------------------
% 0.12/0.36  % (21877)------------------------------
% 0.12/0.36  % (21876)Success in time 0.012 s
% 0.12/0.36  % Vampire---4.8 exiting
%------------------------------------------------------------------------------