TSTP Solution File: NUM298+1 by Vampire---4.8

View Problem - Process Solution

%------------------------------------------------------------------------------
% File     : Vampire---4.8
% Problem  : NUM298+1 : TPTP v8.1.2. Released v3.1.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 : n026.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:28:22 EDT 2024

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

% Comments : 
%------------------------------------------------------------------------------
tff(pred_def_11,type,
    sQ0_eqProxy: 
      !>[X0: $tType] : ( ( X0 * X0 ) > $o ) ).

tff(f457,plain,
    $false,
    inference(subsumption_resolution,[],[f456,f453]) ).

tff(f453,plain,
    ~ less(nn2,n2),
    inference(resolution,[],[f443,f441]) ).

tff(f441,plain,
    less(n2,nn2),
    inference(cnf_transformation,[],[f404]) ).

tff(f404,plain,
    less(n2,nn2),
    inference(flattening,[],[f403]) ).

tff(f403,negated_conjecture,
    ~ ~ less(n2,nn2),
    inference(negated_conjecture,[],[f402]) ).

tff(f402,conjecture,
    ~ less(n2,nn2),
    file('/export/starexec/sandbox/tmp/tmp.y3Vi1HbDjY/Vampire---4.8_24625',n2_not_less_nn2) ).

tff(f443,plain,
    ! [X0: $i,X1: $i] :
      ( ~ less(X1,X0)
      | ~ less(X0,X1) ),
    inference(cnf_transformation,[],[f440]) ).

tff(f440,plain,
    ! [X0,X1] :
      ( ( less(X0,X1)
        | ( X0 = X1 )
        | less(X1,X0) )
      & ( ( ( X0 != X1 )
          & ~ less(X1,X0) )
        | ~ less(X0,X1) ) ),
    inference(flattening,[],[f439]) ).

tff(f439,plain,
    ! [X0,X1] :
      ( ( less(X0,X1)
        | ( X0 = X1 )
        | less(X1,X0) )
      & ( ( ( X0 != X1 )
          & ~ less(X1,X0) )
        | ~ less(X0,X1) ) ),
    inference(nnf_transformation,[],[f284]) ).

tff(f284,axiom,
    ! [X0,X1] :
      ( less(X0,X1)
    <=> ( ( X0 != X1 )
        & ~ less(X1,X0) ) ),
    file('/export/starexec/sandbox/tmp/tmp.y3Vi1HbDjY/Vampire---4.8_24625',less_property) ).

tff(f456,plain,
    less(nn2,n2),
    inference(resolution,[],[f455,f447]) ).

tff(f447,plain,
    rdn_translate(nn2,rdn_neg(rdnn(n2))),
    inference(cnf_transformation,[],[f130]) ).

tff(f130,axiom,
    rdn_translate(nn2,rdn_neg(rdnn(n2))),
    file('/export/starexec/sandbox/tmp/tmp.y3Vi1HbDjY/Vampire---4.8_24625',rdnn2) ).

tff(f455,plain,
    ! [X0: $i,X1: $i] :
      ( ~ rdn_translate(X0,rdn_neg(X1))
      | less(X0,n2) ),
    inference(resolution,[],[f446,f442]) ).

tff(f442,plain,
    rdn_translate(n2,rdn_pos(rdnn(n2))),
    inference(cnf_transformation,[],[f3]) ).

tff(f3,axiom,
    rdn_translate(n2,rdn_pos(rdnn(n2))),
    file('/export/starexec/sandbox/tmp/tmp.y3Vi1HbDjY/Vampire---4.8_24625',rdn2) ).

tff(f446,plain,
    ! [X2: $i,X3: $i,X0: $i,X1: $i] :
      ( ~ rdn_translate(X1,rdn_pos(X3))
      | less(X0,X1)
      | ~ rdn_translate(X0,rdn_neg(X2)) ),
    inference(cnf_transformation,[],[f438]) ).

tff(f438,plain,
    ! [X0,X1,X2,X3] :
      ( less(X0,X1)
      | ~ rdn_translate(X1,rdn_pos(X3))
      | ~ rdn_translate(X0,rdn_neg(X2)) ),
    inference(flattening,[],[f437]) ).

tff(f437,plain,
    ! [X0,X1,X2,X3] :
      ( less(X0,X1)
      | ~ rdn_translate(X1,rdn_pos(X3))
      | ~ rdn_translate(X0,rdn_neg(X2)) ),
    inference(ennf_transformation,[],[f406]) ).

tff(f406,plain,
    ! [X0,X1,X2,X3] :
      ( ( rdn_translate(X1,rdn_pos(X3))
        & rdn_translate(X0,rdn_neg(X2)) )
     => less(X0,X1) ),
    inference(rectify,[],[f282]) ).

tff(f282,axiom,
    ! [X0,X1,X9,X10] :
      ( ( rdn_translate(X1,rdn_pos(X10))
        & rdn_translate(X0,rdn_neg(X9)) )
     => less(X0,X1) ),
    file('/export/starexec/sandbox/tmp/tmp.y3Vi1HbDjY/Vampire---4.8_24625',less_entry_point_neg_pos) ).

%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.03/0.13  % Problem    : NUM298+1 : TPTP v8.1.2. Released v3.1.0.
% 0.03/0.15  % 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 : n026.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   : Tue Apr 30 17:19:04 EDT 2024
% 0.15/0.36  % CPUTime    : 
% 0.15/0.36  This is a FOF_THM_RFO_SEQ problem
% 0.15/0.36  Running 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 300 /export/starexec/sandbox/tmp/tmp.y3Vi1HbDjY/Vampire---4.8_24625
% 0.61/0.81  % (24882)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.61/0.82  % (24877)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.61/0.82  % (24879)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.61/0.82  % (24881)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.61/0.82  % (24878)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.61/0.82  % (24876)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.61/0.82  % (24883)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.61/0.82  % (24880)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.61/0.82  % (24879)Refutation not found, incomplete strategy% (24879)------------------------------
% 0.61/0.82  % (24879)Version: Vampire 4.8 (commit 8e9376e55 on 2024-01-18 13:49:33 +0100)
% 0.61/0.82  % (24879)Termination reason: Refutation not found, incomplete strategy
% 0.61/0.82  
% 0.61/0.82  % (24879)Memory used [KB]: 1254
% 0.61/0.82  % (24879)Time elapsed: 0.003 s
% 0.61/0.82  % (24879)Instructions burned: 3 (million)
% 0.61/0.82  % (24879)------------------------------
% 0.61/0.82  % (24879)------------------------------
% 0.61/0.82  % (24881)Refutation not found, incomplete strategy% (24881)------------------------------
% 0.61/0.82  % (24881)Version: Vampire 4.8 (commit 8e9376e55 on 2024-01-18 13:49:33 +0100)
% 0.61/0.82  % (24881)Termination reason: Refutation not found, incomplete strategy
% 0.61/0.82  
% 0.61/0.82  % (24881)Memory used [KB]: 1269
% 0.61/0.82  % (24881)Time elapsed: 0.003 s
% 0.61/0.82  % (24881)Instructions burned: 4 (million)
% 0.61/0.82  % (24881)------------------------------
% 0.61/0.82  % (24881)------------------------------
% 0.61/0.82  % (24883)Refutation not found, incomplete strategy% (24883)------------------------------
% 0.61/0.82  % (24883)Version: Vampire 4.8 (commit 8e9376e55 on 2024-01-18 13:49:33 +0100)
% 0.61/0.82  % (24883)Termination reason: Refutation not found, incomplete strategy
% 0.61/0.82  
% 0.61/0.82  % (24883)Memory used [KB]: 1257
% 0.61/0.82  % (24883)Time elapsed: 0.003 s
% 0.61/0.82  % (24883)Instructions burned: 4 (million)
% 0.61/0.82  % (24883)------------------------------
% 0.61/0.82  % (24883)------------------------------
% 0.61/0.82  % (24876)First to succeed.
% 0.61/0.82  % (24878)Also succeeded, but the first one will report.
% 0.61/0.82  % (24882)Also succeeded, but the first one will report.
% 0.61/0.82  % (24876)Refutation found. Thanks to Tanya!
% 0.61/0.82  % SZS status Theorem for Vampire---4
% 0.61/0.82  % SZS output start Proof for Vampire---4
% See solution above
% 0.61/0.82  % (24876)------------------------------
% 0.61/0.82  % (24876)Version: Vampire 4.8 (commit 8e9376e55 on 2024-01-18 13:49:33 +0100)
% 0.61/0.82  % (24876)Termination reason: Refutation
% 0.61/0.82  
% 0.61/0.82  % (24876)Memory used [KB]: 1287
% 0.61/0.82  % (24876)Time elapsed: 0.004 s
% 0.61/0.82  % (24876)Instructions burned: 5 (million)
% 0.61/0.82  % (24876)------------------------------
% 0.61/0.82  % (24876)------------------------------
% 0.61/0.82  % (24872)Success in time 0.441 s
% 0.61/0.82  % Vampire---4.8 exiting
%------------------------------------------------------------------------------