TSTP Solution File: ARI601_1 by Vampire---4.8

View Problem - Process Solution

%------------------------------------------------------------------------------
% File     : Vampire---4.8
% Problem  : ARI601_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/sandbox2/solver/bin/quickGreedyProduceRating_steal_pow3.txt --cores 8 -m 12000 -t %d %s

% Computer : n024.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:11 EDT 2024

% Result   : Theorem 0.55s 0.74s
% Output   : Refutation 0.55s
% Verified : 
% SZS Type : Refutation
%            Derivation depth      :   10
%            Number of leaves      :    7
% Syntax   : Number of formulae    :   21 (  11 unt;   2 typ;   0 def)
%            Number of atoms       :   33 (   1 equ)
%            Maximal formula atoms :    3 (   1 avg)
%            Number of connectives :   27 (  13   ~;   4   |;   4   &)
%                                         (   0 <=>;   6  =>;   0  <=;   0 <~>)
%            Maximal formula depth :    7 (   3 avg)
%            Maximal term depth    :    3 (   1 avg)
%            Number arithmetic     :   92 (  31 atm;  15 fun;  31 num;  15 var)
%            Number of types       :    1 (   0 usr;   1 ari)
%            Number of type conns  :    1 (   1   >;   0   *;   0   +;   0  <<)
%            Number of predicates  :    4 (   0 usr;   1 prp; 0-2 aty)
%            Number of functors    :    6 (   2 usr;   4 con; 0-2 aty)
%            Number of variables   :   15 (  15   !;   0   ?;  15   :)

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

tff(func_def_1,type,
    f: $int > $int ).

tff(f182,plain,
    $false,
    inference(subsumption_resolution,[],[f176,f45]) ).

tff(f45,plain,
    $less(4,$sum(1,a)),
    inference(forward_demodulation,[],[f41,f4]) ).

tff(f4,plain,
    ! [X0: $int,X1: $int] : ( $sum(X0,X1) = $sum(X1,X0) ),
    introduced(theory_axiom_135,[]) ).

tff(f41,plain,
    $less(4,$sum(a,1)),
    inference(unit_resulting_resolution,[],[f27,f13]) ).

tff(f13,plain,
    ! [X0: $int,X1: $int] :
      ( $less(X1,$sum(X0,1))
      | $less(X0,X1) ),
    introduced(theory_axiom_147,[]) ).

tff(f27,plain,
    ~ $less(a,4),
    inference(evaluation,[],[f22]) ).

tff(f22,plain,
    ~ $less(a,$sum(3,1)),
    inference(unit_resulting_resolution,[],[f19,f15]) ).

tff(f15,plain,
    ! [X0: $int,X1: $int] :
      ( ~ $less(X1,$sum(X0,1))
      | ~ $less(X0,X1) ),
    introduced(theory_axiom_161,[]) ).

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

tff(f17,plain,
    ( ~ $less(4,f($sum(a,1)))
    & $less(3,a)
    & ! [X0: $int] : $less(X0,f(X0)) ),
    inference(flattening,[],[f16]) ).

tff(f16,plain,
    ( ~ $less(4,f($sum(a,1)))
    & $less(3,a)
    & ! [X0: $int] : $less(X0,f(X0)) ),
    inference(ennf_transformation,[],[f3]) ).

tff(f3,plain,
    ~ ( ! [X0: $int] : $less(X0,f(X0))
     => ( $less(3,a)
       => $less(4,f($sum(a,1))) ) ),
    inference(theory_normalization,[],[f2]) ).

tff(f2,negated_conjecture,
    ~ ( ! [X0: $int] : $greater(f(X0),X0)
     => ( $less(3,a)
       => $less(4,f($sum(a,1))) ) ),
    inference(negated_conjecture,[],[f1]) ).

tff(f1,conjecture,
    ( ! [X0: $int] : $greater(f(X0),X0)
   => ( $less(3,a)
     => $less(4,f($sum(a,1))) ) ),
    file('/export/starexec/sandbox2/benchmark/theBenchmark.p',fX_gt_X_implies_ineq) ).

tff(f176,plain,
    ~ $less(4,$sum(1,a)),
    inference(unit_resulting_resolution,[],[f18,f21,f10]) ).

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

tff(f21,plain,
    ~ $less(4,f($sum(1,a))),
    inference(forward_demodulation,[],[f20,f4]) ).

tff(f20,plain,
    ~ $less(4,f($sum(a,1))),
    inference(cnf_transformation,[],[f17]) ).

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

%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.02/0.11  % Problem    : ARI601_1 : TPTP v8.2.0. Released v5.1.0.
% 0.12/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.13/0.34  % Computer : n024.cluster.edu
% 0.13/0.34  % Model    : x86_64 x86_64
% 0.13/0.34  % CPU      : Intel(R) Xeon(R) CPU E5-2620 v4 @ 2.10GHz
% 0.13/0.34  % Memory   : 8042.1875MB
% 0.13/0.34  % OS       : Linux 3.10.0-693.el7.x86_64
% 0.13/0.34  % CPULimit   : 300
% 0.13/0.34  % WCLimit    : 300
% 0.13/0.34  % DateTime   : Sun May 19 13:29:23 EDT 2024
% 0.13/0.34  % CPUTime    : 
% 0.13/0.34  This is a TF0_THM_NEQ_ARI problem
% 0.13/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/benchmark/theBenchmark.p
% 0.55/0.74  % (16768)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.55/0.74  % (16762)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.55/0.74  % (16764)lrs+1011_1:1_sil=8000:sp=occurrence:nwc=10.0:i=78:ss=axioms:sgt=8_0 on theBenchmark for (2996ds/78Mi)
% 0.55/0.74  % (16765)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.55/0.74  % (16766)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.55/0.74  % (16763)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.55/0.74  % (16767)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.55/0.74  % (16769)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 (2996ds/56Mi)
% 0.55/0.74  % (16768)First to succeed.
% 0.55/0.74  % (16765)Also succeeded, but the first one will report.
% 0.55/0.74  % (16768)Solution written to "/export/starexec/sandbox2/tmp/vampire-proof-16596"
% 0.55/0.74  % (16768)Refutation found. Thanks to Tanya!
% 0.55/0.74  % SZS status Theorem for theBenchmark
% 0.55/0.74  % SZS output start Proof for theBenchmark
% See solution above
% 0.55/0.74  % (16768)------------------------------
% 0.55/0.74  % (16768)Version: Vampire 4.8 (commit 3a798227e on 2024-05-03 07:42:47 +0200)
% 0.55/0.74  % (16768)Termination reason: Refutation
% 0.55/0.74  
% 0.55/0.74  % (16768)Memory used [KB]: 1062
% 0.55/0.74  % (16768)Time elapsed: 0.004 s
% 0.55/0.74  % (16768)Instructions burned: 7 (million)
% 0.55/0.74  % (16596)Success in time 0.393 s
% 0.55/0.74  % Vampire---4.8 exiting
%------------------------------------------------------------------------------