TSTP Solution File: NUM838+2 by Vampire---4.8

View Problem - Process Solution

%------------------------------------------------------------------------------
% File     : Vampire---4.8
% Problem  : NUM838+2 : TPTP v8.2.0. Released v4.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/sandbox2/solver/bin/quickGreedyProduceRating_steal_pow3.txt --cores 8 -m 12000 -t %d %s

% Computer : n025.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 01:46:22 EDT 2024

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

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

tff(f135,plain,
    $false,
    inference(subsumption_resolution,[],[f131,f73]) ).

tff(f73,plain,
    greater(vd301,vd302),
    inference(cnf_transformation,[],[f3]) ).

tff(f3,axiom,
    greater(vd301,vd302),
    file('/export/starexec/sandbox2/benchmark/theBenchmark.p','holds(antec(195), 304, 0)') ).

tff(f131,plain,
    ~ greater(vd301,vd302),
    inference(resolution,[],[f82,f72]) ).

tff(f72,plain,
    ~ greater(vplus(vd301,vd303),vplus(vd302,vd303)),
    inference(cnf_transformation,[],[f32]) ).

tff(f32,plain,
    ~ greater(vplus(vd301,vd303),vplus(vd302,vd303)),
    inference(flattening,[],[f2]) ).

tff(f2,negated_conjecture,
    ~ greater(vplus(vd301,vd303),vplus(vd302,vd303)),
    inference(negated_conjecture,[],[f1]) ).

tff(f1,conjecture,
    greater(vplus(vd301,vd303),vplus(vd302,vd303)),
    file('/export/starexec/sandbox2/benchmark/theBenchmark.p','holds(conseq(195), 305, 0)') ).

tff(f82,plain,
    ! [X2: $i,X0: $i,X1: $i] :
      ( greater(vplus(X1,X0),vplus(X2,X0))
      | ~ greater(X1,X2) ),
    inference(cnf_transformation,[],[f52]) ).

tff(f52,plain,
    ! [X0,X1,X2] :
      ( greater(vplus(X1,X0),vplus(X2,X0))
      | ~ greater(X1,X2) ),
    inference(ennf_transformation,[],[f40]) ).

tff(f40,plain,
    ! [X0,X1,X2] :
      ( greater(X1,X2)
     => greater(vplus(X1,X0),vplus(X2,X0)) ),
    inference(rectify,[],[f8]) ).

tff(f8,axiom,
    ! [X0,X5,X6] :
      ( greater(X5,X6)
     => greater(vplus(X5,X0),vplus(X6,X0)) ),
    file('/export/starexec/sandbox2/benchmark/theBenchmark.p','ass(cond(proof(196), 0), 4)') ).

%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.12/0.13  % Problem    : NUM838+2 : TPTP v8.2.0. Released v4.1.0.
% 0.12/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.15/0.35  % Computer : n025.cluster.edu
% 0.15/0.35  % Model    : x86_64 x86_64
% 0.15/0.35  % CPU      : Intel(R) Xeon(R) CPU E5-2620 v4 @ 2.10GHz
% 0.15/0.35  % Memory   : 8042.1875MB
% 0.15/0.35  % OS       : Linux 3.10.0-693.el7.x86_64
% 0.15/0.35  % CPULimit   : 300
% 0.15/0.35  % WCLimit    : 300
% 0.15/0.35  % DateTime   : Mon May 20 05:11:23 EDT 2024
% 0.15/0.35  % CPUTime    : 
% 0.15/0.35  This is a FOF_THM_RFO_SEQ problem
% 0.15/0.35  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/benchmark/theBenchmark.p
% 0.54/0.73  % (6585)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 theBenchmark for (2996ds/34Mi)
% 0.54/0.73  % (6587)lrs+1011_1:1_sil=8000:sp=occurrence:nwc=10.0:i=78:ss=axioms:sgt=8_0 on theBenchmark for (2996ds/78Mi)
% 0.54/0.73  % (6586)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 theBenchmark for (2996ds/51Mi)
% 0.54/0.73  % (6591)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 theBenchmark for (2996ds/83Mi)
% 0.54/0.73  % (6589)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 theBenchmark for (2996ds/34Mi)
% 0.54/0.73  % (6590)lrs+1002_1:16_to=lpo:sil=32000:sp=unary_frequency:sos=on:i=45:bd=off:ss=axioms_0 on theBenchmark for (2996ds/45Mi)
% 0.54/0.73  % (6588)ott+1011_1:1_sil=2000:urr=on:i=33:sd=1:kws=inv_frequency:ss=axioms:sup=off_0 on theBenchmark for (2996ds/33Mi)
% 0.54/0.73  % (6585)First to succeed.
% 0.54/0.73  % (6588)Also succeeded, but the first one will report.
% 0.54/0.73  % (6591)Refutation not found, incomplete strategy% (6591)------------------------------
% 0.54/0.73  % (6591)Version: Vampire 4.8 (commit 3a798227e on 2024-05-03 07:42:47 +0200)
% 0.54/0.73  % (6591)Termination reason: Refutation not found, incomplete strategy
% 0.54/0.73  
% 0.54/0.73  % (6591)Memory used [KB]: 1038
% 0.54/0.73  % (6591)Time elapsed: 0.002 s
% 0.54/0.73  % (6591)Instructions burned: 3 (million)
% 0.54/0.73  % (6590)Refutation not found, incomplete strategy% (6590)------------------------------
% 0.54/0.73  % (6590)Version: Vampire 4.8 (commit 3a798227e on 2024-05-03 07:42:47 +0200)
% 0.54/0.73  % (6585)Solution written to "/export/starexec/sandbox2/tmp/vampire-proof-6584"
% 0.54/0.73  % (6590)Termination reason: Refutation not found, incomplete strategy
% 0.54/0.73  
% 0.54/0.73  % (6590)Memory used [KB]: 1039
% 0.54/0.73  % (6590)Time elapsed: 0.003 s
% 0.54/0.73  % (6590)Instructions burned: 2 (million)
% 0.54/0.73  % (6591)------------------------------
% 0.54/0.73  % (6591)------------------------------
% 0.54/0.73  % (6589)Also succeeded, but the first one will report.
% 0.54/0.73  % (6590)------------------------------
% 0.54/0.73  % (6590)------------------------------
% 0.54/0.73  % (6585)Refutation found. Thanks to Tanya!
% 0.54/0.73  % SZS status Theorem for theBenchmark
% 0.54/0.73  % SZS output start Proof for theBenchmark
% See solution above
% 0.54/0.73  % (6585)------------------------------
% 0.54/0.73  % (6585)Version: Vampire 4.8 (commit 3a798227e on 2024-05-03 07:42:47 +0200)
% 0.54/0.73  % (6585)Termination reason: Refutation
% 0.54/0.73  
% 0.54/0.73  % (6585)Memory used [KB]: 1069
% 0.54/0.73  % (6585)Time elapsed: 0.002 s
% 0.54/0.73  % (6585)Instructions burned: 4 (million)
% 0.54/0.73  % (6584)Success in time 0.377 s
% 0.54/0.74  % Vampire---4.8 exiting
%------------------------------------------------------------------------------