TSTP Solution File: ARI608_1 by Vampire---4.8

View Problem - Process Solution

%------------------------------------------------------------------------------
% File     : Vampire---4.8
% Problem  : ARI608_1 : TPTP v8.2.0. Released v5.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 : n012.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 : Mon May 20 18:48:13 EDT 2024

% Result   : Theorem 0.73s 0.90s
% Output   : Refutation 0.73s
% Verified : 
% SZS Type : Refutation
%            Derivation depth      :    8
%            Number of leaves      :    7
% Syntax   : Number of formulae    :   19 (   6 unt;   5 typ;   0 def)
%            Number of atoms       :   38 (   0 equ)
%            Maximal formula atoms :    5 (   2 avg)
%            Number of connectives :   41 (  17   ~;   6   |;  12   &)
%                                         (   0 <=>;   6  =>;   0  <=;   0 <~>)
%            Maximal formula depth :    9 (   5 avg)
%            Maximal term depth    :    2 (   1 avg)
%            Number arithmetic     :   53 (  37 atm;   0 fun;   0 num;  16 var)
%            Number of types       :    2 (   0 usr;   1 ari)
%            Number of type conns  :    3 (   2   >;   1   *;   0   +;   0  <<)
%            Number of predicates  :    4 (   1 usr;   1 prp; 0-3 aty)
%            Number of functors    :    4 (   4 usr;   3 con; 0-1 aty)
%            Number of variables   :   17 (  16   !;   0   ?;  17   :)
%                                         (   1  !>;   0  ?*;   0  @-;   0  @+)

% Comments : 
%------------------------------------------------------------------------------
tff(func_def_0,type,
    f: $int > $int ).

tff(func_def_1,type,
    a: $int ).

tff(func_def_2,type,
    b: $int ).

tff(func_def_3,type,
    c: $int ).

tff(pred_def_3,type,
    sQ0_eqProxy: 
      !>[X0: $tType] : ( ( X0 * X0 ) > $o ) ).

tff(f33,plain,
    $false,
    inference(subsumption_resolution,[],[f31,f26]) ).

tff(f26,plain,
    $less(c,a),
    inference(resolution,[],[f18,f21]) ).

tff(f21,plain,
    $less(f(c),f(a)),
    inference(cnf_transformation,[],[f17]) ).

tff(f17,plain,
    ( $less(f(c),f(a))
    & $less(b,c)
    & ~ $less(b,a)
    & ! [X0: $int,X1: $int] :
        ( ~ $less(f(X1),f(X0))
        | $less(X1,X0) ) ),
    inference(flattening,[],[f16]) ).

tff(f16,plain,
    ( $less(f(c),f(a))
    & $less(b,c)
    & ~ $less(b,a)
    & ! [X0: $int,X1: $int] :
        ( ~ $less(f(X1),f(X0))
        | $less(X1,X0) ) ),
    inference(ennf_transformation,[],[f3]) ).

tff(f3,plain,
    ~ ( ( $less(b,c)
        & ~ $less(b,a)
        & ! [X0: $int,X1: $int] :
            ( ~ $less(X1,X0)
           => ~ $less(f(X1),f(X0)) ) )
     => ~ $less(f(c),f(a)) ),
    inference(theory_normalization,[],[f2]) ).

tff(f2,negated_conjecture,
    ~ ( ( $less(b,c)
        & $lesseq(a,b)
        & ! [X0: $int,X1: $int] :
            ( $lesseq(X0,X1)
           => $lesseq(f(X0),f(X1)) ) )
     => $lesseq(f(a),f(c)) ),
    inference(negated_conjecture,[],[f1]) ).

tff(f1,conjecture,
    ( ( $less(b,c)
      & $lesseq(a,b)
      & ! [X0: $int,X1: $int] :
          ( $lesseq(X0,X1)
         => $lesseq(f(X0),f(X1)) ) )
   => $lesseq(f(a),f(c)) ),
    file('/export/starexec/sandbox/benchmark/theBenchmark.p',f_mon_implies_trans) ).

tff(f18,plain,
    ! [X0: $int,X1: $int] :
      ( ~ $less(f(X1),f(X0))
      | $less(X1,X0) ),
    inference(cnf_transformation,[],[f17]) ).

tff(f31,plain,
    ~ $less(c,a),
    inference(resolution,[],[f27,f20]) ).

tff(f20,plain,
    $less(b,c),
    inference(cnf_transformation,[],[f17]) ).

tff(f27,plain,
    ! [X0: $int] :
      ( ~ $less(b,X0)
      | ~ $less(X0,a) ),
    inference(resolution,[],[f10,f19]) ).

tff(f19,plain,
    ~ $less(b,a),
    inference(cnf_transformation,[],[f17]) ).

tff(f10,plain,
    ! [X2: $int,X0: $int,X1: $int] :
      ( $less(X0,X2)
      | ~ $less(X1,X2)
      | ~ $less(X0,X1) ),
    introduced(theory_axiom_143,[]) ).

%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.13/0.12  % Problem    : ARI608_1 : TPTP v8.2.0. Released v5.1.0.
% 0.13/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 : n012.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   : Sun May 19 13:23:08 EDT 2024
% 0.15/0.36  % CPUTime    : 
% 0.15/0.36  This is a TF0_THM_NEQ_ARI 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/benchmark/theBenchmark.p
% 0.73/0.90  % (24802)lrs+1011_1:1_sil=8000:sp=occurrence:nwc=10.0:i=78:ss=axioms:sgt=8_0 on theBenchmark for (2994ds/78Mi)
% 0.73/0.90  % (24800)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 (2994ds/34Mi)
% 0.73/0.90  % (24801)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 (2994ds/51Mi)
% 0.73/0.90  % (24803)ott+1011_1:1_sil=2000:urr=on:i=33:sd=1:kws=inv_frequency:ss=axioms:sup=off_0 on theBenchmark for (2994ds/33Mi)
% 0.73/0.90  % (24805)lrs+1002_1:16_to=lpo:sil=32000:sp=unary_frequency:sos=on:i=45:bd=off:ss=axioms_0 on theBenchmark for (2994ds/45Mi)
% 0.73/0.90  % (24804)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 (2994ds/34Mi)
% 0.73/0.90  % (24806)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 (2994ds/83Mi)
% 0.73/0.90  % (24807)lrs-21_1:1_to=lpo:sil=2000:sp=frequency:sos=on:lma=on:i=56:sd=2:ss=axioms:ep=R_0 on theBenchmark for (2994ds/56Mi)
% 0.73/0.90  % (24803)Also succeeded, but the first one will report.
% 0.73/0.90  % (24800)First to succeed.
% 0.73/0.90  % (24804)Also succeeded, but the first one will report.
% 0.73/0.90  % (24800)Solution written to "/export/starexec/sandbox/tmp/vampire-proof-24799"
% 0.73/0.90  % (24805)Also succeeded, but the first one will report.
% 0.73/0.90  % (24807)Also succeeded, but the first one will report.
% 0.73/0.90  % (24800)Refutation found. Thanks to Tanya!
% 0.73/0.90  % SZS status Theorem for theBenchmark
% 0.73/0.90  % SZS output start Proof for theBenchmark
% See solution above
% 0.73/0.90  % (24800)------------------------------
% 0.73/0.90  % (24800)Version: Vampire 4.8 (commit 3a798227e on 2024-05-03 07:42:47 +0200)
% 0.73/0.90  % (24800)Termination reason: Refutation
% 0.73/0.90  
% 0.73/0.90  % (24800)Memory used [KB]: 976
% 0.73/0.90  % (24800)Time elapsed: 0.003 s
% 0.73/0.90  % (24800)Instructions burned: 3 (million)
% 0.73/0.90  % (24799)Success in time 0.528 s
% 0.73/0.90  % Vampire---4.8 exiting
%------------------------------------------------------------------------------