TSTP Solution File: NUM657_8 by Vampire---4.8

View Problem - Process Solution

%------------------------------------------------------------------------------
% File     : Vampire---4.8
% Problem  : NUM657_8 : TPTP v8.1.2. Released v8.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 : n020.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 : Wed May  1 03:32:59 EDT 2024

% Result   : Theorem 0.62s 0.82s
% Output   : Refutation 0.62s
% Verified : 
% SZS Type : Refutation
%            Derivation depth      :    9
%            Number of leaves      :   10
% Syntax   : Number of formulae    :   32 (   6 unt;   5 typ;   0 def)
%            Number of atoms       :   68 (  18 equ)
%            Maximal formula atoms :    6 (   2 avg)
%            Number of connectives :   92 (  51   ~;  17   |;   4   &)
%                                         (   2 <=>;  18  =>;   0  <=;   0 <~>)
%            Maximal formula depth :   11 (   4 avg)
%            Maximal term depth    :    1 (   1 avg)
%            Number of types       :    2 (   1 usr)
%            Number of type conns  :    4 (   2   >;   2   *;   0   +;   0  <<)
%            Number of predicates  :    6 (   4 usr;   3 prp; 0-2 aty)
%            Number of functors    :    2 (   2 usr;   2 con; 0-0 aty)
%            Number of variables   :   15 (  15   !;   0   ?;  15   :)

% Comments : 
%------------------------------------------------------------------------------
tff(type_def_5,type,
    nat: $tType ).

tff(func_def_0,type,
    x: nat ).

tff(func_def_1,type,
    y: nat ).

tff(pred_def_1,type,
    less: ( nat * nat ) > $o ).

tff(pred_def_2,type,
    more: ( nat * nat ) > $o ).

tff(f38,plain,
    $false,
    inference(avatar_sat_refutation,[],[f31,f34,f37]) ).

tff(f37,plain,
    ~ spl0_1,
    inference(avatar_contradiction_clause,[],[f36]) ).

tff(f36,plain,
    ( $false
    | ~ spl0_1 ),
    inference(subsumption_resolution,[],[f35,f17]) ).

tff(f17,plain,
    less(x,y),
    inference(cnf_transformation,[],[f1]) ).

tff(f1,axiom,
    less(x,y),
    file('/export/starexec/sandbox2/tmp/tmp.srcG8Qv9ir/Vampire---4.8_31788',l) ).

tff(f35,plain,
    ( ~ less(x,y)
    | ~ spl0_1 ),
    inference(resolution,[],[f26,f19]) ).

tff(f19,plain,
    ! [X0: nat,X1: nat] :
      ( ~ more(X0,X1)
      | ~ less(X0,X1) ),
    inference(cnf_transformation,[],[f15]) ).

tff(f15,plain,
    ! [X0: nat,X1: nat] :
      ( ( ( X0 != X1 )
        | ~ less(X0,X1) )
      & ( ~ less(X0,X1)
        | ~ more(X0,X1) )
      & ( ~ more(X0,X1)
        | ( X0 != X1 ) ) ),
    inference(flattening,[],[f14]) ).

tff(f14,plain,
    ! [X0: nat,X1: nat] :
      ( ( ( X0 != X1 )
        | ~ less(X0,X1) )
      & ( ~ less(X0,X1)
        | ~ more(X0,X1) )
      & ( ~ more(X0,X1)
        | ( X0 != X1 ) ) ),
    inference(ennf_transformation,[],[f12]) ).

tff(f12,plain,
    ! [X0: nat,X1: nat] :
      ~ ( ( ( X0 = X1 )
         => ~ more(X0,X1) )
       => ( ( more(X0,X1)
           => ~ less(X0,X1) )
         => ~ ( less(X0,X1)
             => ( X0 != X1 ) ) ) ),
    inference(flattening,[],[f11]) ).

tff(f11,plain,
    ! [X0: nat,X1: nat] :
      ~ ( ( ( X0 = X1 )
         => ~ more(X0,X1) )
       => ~ ~ ( ( more(X0,X1)
               => ~ less(X0,X1) )
             => ~ ( less(X0,X1)
                 => ( X0 != X1 ) ) ) ),
    inference(rectify,[],[f3]) ).

tff(f3,axiom,
    ! [X1: nat,X2: nat] :
      ~ ( ( ( X1 = X2 )
         => ~ more(X1,X2) )
       => ~ ~ ( ( more(X1,X2)
               => ~ less(X1,X2) )
             => ~ ( less(X1,X2)
                 => ( X1 != X2 ) ) ) ),
    file('/export/starexec/sandbox2/tmp/tmp.srcG8Qv9ir/Vampire---4.8_31788',satz10b) ).

tff(f26,plain,
    ( more(x,y)
    | ~ spl0_1 ),
    inference(avatar_component_clause,[],[f24]) ).

tff(f24,plain,
    ( spl0_1
  <=> more(x,y) ),
    introduced(avatar_definition,[new_symbols(naming,[spl0_1])]) ).

tff(f34,plain,
    ~ spl0_2,
    inference(avatar_contradiction_clause,[],[f33]) ).

tff(f33,plain,
    ( $false
    | ~ spl0_2 ),
    inference(subsumption_resolution,[],[f32,f21]) ).

tff(f21,plain,
    ! [X1: nat] : ~ less(X1,X1),
    inference(equality_resolution,[],[f20]) ).

tff(f20,plain,
    ! [X0: nat,X1: nat] :
      ( ( X0 != X1 )
      | ~ less(X0,X1) ),
    inference(cnf_transformation,[],[f15]) ).

tff(f32,plain,
    ( less(x,x)
    | ~ spl0_2 ),
    inference(superposition,[],[f17,f30]) ).

tff(f30,plain,
    ( ( x = y )
    | ~ spl0_2 ),
    inference(avatar_component_clause,[],[f28]) ).

tff(f28,plain,
    ( spl0_2
  <=> ( x = y ) ),
    introduced(avatar_definition,[new_symbols(naming,[spl0_2])]) ).

tff(f31,plain,
    ( spl0_1
    | spl0_2 ),
    inference(avatar_split_clause,[],[f16,f28,f24]) ).

tff(f16,plain,
    ( ( x = y )
    | more(x,y) ),
    inference(cnf_transformation,[],[f13]) ).

tff(f13,plain,
    ( ( x = y )
    | more(x,y) ),
    inference(ennf_transformation,[],[f10]) ).

tff(f10,plain,
    ( ~ more(x,y)
   => ( x = y ) ),
    inference(flattening,[],[f5]) ).

tff(f5,negated_conjecture,
    ~ ~ ( ~ more(x,y)
       => ( x = y ) ),
    inference(negated_conjecture,[],[f4]) ).

tff(f4,conjecture,
    ~ ( ~ more(x,y)
     => ( x = y ) ),
    file('/export/starexec/sandbox2/tmp/tmp.srcG8Qv9ir/Vampire---4.8_31788',satz10h) ).

%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.10/0.11  % Problem    : NUM657_8 : TPTP v8.1.2. Released v8.0.0.
% 0.10/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.33  % Computer : n020.cluster.edu
% 0.12/0.33  % Model    : x86_64 x86_64
% 0.12/0.33  % CPU      : Intel(R) Xeon(R) CPU E5-2620 v4 @ 2.10GHz
% 0.12/0.33  % Memory   : 8042.1875MB
% 0.12/0.33  % OS       : Linux 3.10.0-693.el7.x86_64
% 0.12/0.33  % CPULimit   : 300
% 0.12/0.33  % WCLimit    : 300
% 0.12/0.33  % DateTime   : Tue Apr 30 16:44:47 EDT 2024
% 0.12/0.34  % CPUTime    : 
% 0.12/0.34  This is a TX0_THM_EQU_NAR problem
% 0.12/0.34  Running 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 300 /export/starexec/sandbox2/tmp/tmp.srcG8Qv9ir/Vampire---4.8_31788
% 0.62/0.82  % (31899)lrs+1011_1:1_sil=8000:sp=occurrence:nwc=10.0:i=78:ss=axioms:sgt=8_0 on Vampire---4 for (2995ds/78Mi)
% 0.62/0.82  % (31901)lrs+2_1:1_sil=16000:fde=none:sos=all:nwc=5.0:i=34:ep=RS:s2pl=on:lma=on:afp=100000_0 on Vampire---4 for (2995ds/34Mi)
% 0.62/0.82  % (31902)lrs+1002_1:16_to=lpo:sil=32000:sp=unary_frequency:sos=on:i=45:bd=off:ss=axioms_0 on Vampire---4 for (2995ds/45Mi)
% 0.62/0.82  % (31900)ott+1011_1:1_sil=2000:urr=on:i=33:sd=1:kws=inv_frequency:ss=axioms:sup=off_0 on Vampire---4 for (2995ds/33Mi)
% 0.62/0.82  % (31897)dis-1011_2:1_sil=2000:lsd=20:nwc=5.0:flr=on:mep=off:st=3.0:i=34:sd=1:ep=RS:ss=axioms_0 on Vampire---4 for (2995ds/34Mi)
% 0.62/0.82  % (31903)lrs+21_1:5_sil=2000:sos=on:urr=on:newcnf=on:slsq=on:i=83:slsql=off:bd=off:nm=2:ss=axioms:st=1.5:sp=const_min:gsp=on:rawr=on_0 on Vampire---4 for (2995ds/83Mi)
% 0.62/0.82  % (31898)lrs+1011_461:32768_sil=16000:irw=on:sp=frequency:lsd=20:fd=preordered:nwc=10.0:s2agt=32:alpa=false:cond=fast:s2a=on:i=51:s2at=3.0:awrs=decay:awrsf=691:bd=off:nm=20:fsr=off:amm=sco:uhcvi=on:rawr=on_0 on Vampire---4 for (2995ds/51Mi)
% 0.62/0.82  % (31904)lrs-21_1:1_to=lpo:sil=2000:sp=frequency:sos=on:lma=on:i=56:sd=2:ss=axioms:ep=R_0 on Vampire---4 for (2995ds/56Mi)
% 0.62/0.82  % (31904)Refutation not found, incomplete strategy% (31904)------------------------------
% 0.62/0.82  % (31904)Version: Vampire 4.8 (commit 8e9376e55 on 2024-01-18 13:49:33 +0100)
% 0.62/0.82  % (31904)Termination reason: Refutation not found, incomplete strategy
% 0.62/0.82  
% 0.62/0.82  % (31904)Memory used [KB]: 949
% 0.62/0.82  % (31904)Time elapsed: 0.002 s
% 0.62/0.82  % (31904)Instructions burned: 2 (million)
% 0.62/0.82  % (31904)------------------------------
% 0.62/0.82  % (31904)------------------------------
% 0.62/0.82  % (31897)Refutation not found, incomplete strategy% (31897)------------------------------
% 0.62/0.82  % (31897)Version: Vampire 4.8 (commit 8e9376e55 on 2024-01-18 13:49:33 +0100)
% 0.62/0.82  % (31897)Termination reason: Refutation not found, incomplete strategy
% 0.62/0.82  
% 0.62/0.82  % (31897)Memory used [KB]: 966
% 0.62/0.82  % (31897)Time elapsed: 0.003 s
% 0.62/0.82  % (31897)Instructions burned: 2 (million)
% 0.62/0.82  % (31902)First to succeed.
% 0.62/0.82  % (31897)------------------------------
% 0.62/0.82  % (31897)------------------------------
% 0.62/0.82  % (31901)Refutation not found, incomplete strategy% (31901)------------------------------
% 0.62/0.82  % (31901)Version: Vampire 4.8 (commit 8e9376e55 on 2024-01-18 13:49:33 +0100)
% 0.62/0.82  % (31901)Termination reason: Refutation not found, incomplete strategy
% 0.62/0.82  
% 0.62/0.82  % (31901)Memory used [KB]: 966
% 0.62/0.82  % (31901)Time elapsed: 0.003 s
% 0.62/0.82  % (31901)Instructions burned: 2 (million)
% 0.62/0.82  % (31901)------------------------------
% 0.62/0.82  % (31901)------------------------------
% 0.62/0.82  % (31903)Also succeeded, but the first one will report.
% 0.62/0.82  % (31902)Refutation found. Thanks to Tanya!
% 0.62/0.82  % SZS status Theorem for Vampire---4
% 0.62/0.82  % SZS output start Proof for Vampire---4
% See solution above
% 0.62/0.82  % (31902)------------------------------
% 0.62/0.82  % (31902)Version: Vampire 4.8 (commit 8e9376e55 on 2024-01-18 13:49:33 +0100)
% 0.62/0.82  % (31902)Termination reason: Refutation
% 0.62/0.82  
% 0.62/0.82  % (31902)Memory used [KB]: 969
% 0.62/0.82  % (31902)Time elapsed: 0.003 s
% 0.62/0.82  % (31902)Instructions burned: 3 (million)
% 0.62/0.82  % (31902)------------------------------
% 0.62/0.82  % (31902)------------------------------
% 0.62/0.82  % (31895)Success in time 0.482 s
% 0.62/0.82  % Vampire---4.8 exiting
%------------------------------------------------------------------------------