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

View Problem - Process Solution

%------------------------------------------------------------------------------
% File     : Vampire---4.8
% Problem  : SYO086^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:02:53 EDT 2024

% Result   : Theorem 0.15s 0.38s
% Output   : Refutation 0.15s
% Verified : 
% SZS Type : Refutation
%            Derivation depth      :    9
%            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 :  110 (  45   ~;  16   |;  39   &)
%                                         (   0 <=>;  10  =>;   0  <=;   0 <~>)
%            Maximal formula depth :    7 (   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   :    0 (   0   !;   0   ?;   0   :)

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

tff(f20,plain,
    cQ != $true,
    inference(subsumption_resolution,[],[f14,f10]) ).

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

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

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

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

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

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

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

tff(f1,conjecture,
    ( ( ~ cP
      & ( ( ~ cQ
          & cR )
        | ( ~ cR
          & cQ ) ) )
   => ( ( ( cQ
          & cP )
        | ( ~ cQ
          & ~ cP ) )
     => cR ) ),
    file('/export/starexec/sandbox/benchmark/theBenchmark.p',cTHM50_11) ).

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

tff(f21,plain,
    cQ = $true,
    inference(subsumption_resolution,[],[f19,f15]) ).

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

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

%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.03/0.13  % Problem    : SYO086^5 : TPTP v8.2.0. Released v4.0.0.
% 0.14/0.14  % 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.15/0.36  % Computer : n010.cluster.edu
% 0.15/0.36  % Model    : x86_64 x86_64
% 0.15/0.36  % CPU      : Intel(R) Xeon(R) CPU E5-2620 v4 @ 2.10GHz
% 0.15/0.36  % Memory   : 8042.1875MB
% 0.15/0.36  % OS       : Linux 3.10.0-693.el7.x86_64
% 0.15/0.36  % CPULimit   : 300
% 0.15/0.36  % WCLimit    : 300
% 0.15/0.36  % DateTime   : Mon May 20 08:43:23 EDT 2024
% 0.15/0.36  % CPUTime    : 
% 0.15/0.36  This is a TH0_THM_NEQ_NAR problem
% 0.15/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/sandbox/benchmark/theBenchmark.p
% 0.15/0.38  % (16136)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.15/0.38  % (16136)First to succeed.
% 0.15/0.38  % (16129)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.15/0.38  % (16130)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.15/0.38  % (16131)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.15/0.38  % (16133)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.15/0.38  % (16132)lrs+10_1:1_au=on:inj=on:i=2:si=on:rtra=on_0 on theBenchmark for (3000ds/2Mi)
% 0.15/0.38  % (16129)Also succeeded, but the first one will report.
% 0.15/0.38  % (16136)Refutation found. Thanks to Tanya!
% 0.15/0.38  % SZS status Theorem for theBenchmark
% 0.15/0.38  % SZS output start Proof for theBenchmark
% See solution above
% 0.15/0.38  % (16136)------------------------------
% 0.15/0.38  % (16136)Version: Vampire 4.8 HO - Sledgehammer schedules (2023-10-19)
% 0.15/0.38  % (16136)Termination reason: Refutation
% 0.15/0.38  
% 0.15/0.38  % (16136)Memory used [KB]: 5500
% 0.15/0.38  % (16136)Time elapsed: 0.002 s
% 0.15/0.38  % (16136)Instructions burned: 1 (million)
% 0.15/0.38  % (16136)------------------------------
% 0.15/0.38  % (16136)------------------------------
% 0.15/0.38  % (16128)Success in time 0.015 s
% 0.15/0.38  % Vampire---4.8 exiting
%------------------------------------------------------------------------------