TSTP Solution File: ARI018_1 by Vampire---4.8

View Problem - Process Solution

%------------------------------------------------------------------------------
% File     : Vampire---4.8
% Problem  : ARI018_1 : TPTP v8.2.0. Released v5.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/sandbox/solver/bin/quickGreedyProduceRating_steal_pow3.txt --cores 8 -m 12000 -t %d %s

% Computer : n032.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:46:17 EDT 2024

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

% Comments : 
%------------------------------------------------------------------------------
tff(pred_def_3,type,
    sQ0_eqProxy: ( $int * $int ) > $o ).

tff(f23,plain,
    $false,
    inference(resolution,[],[f17,f9]) ).

tff(f9,plain,
    ! [X0: $int] : ~ $less(X0,X0),
    introduced(theory_axiom_142,[]) ).

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

tff(f16,plain,
    ! [X0: $int] : $less(X0,12),
    inference(ennf_transformation,[],[f3]) ).

tff(f3,plain,
    ~ ? [X0: $int] : ~ $less(X0,12),
    inference(theory_normalization,[],[f2]) ).

tff(f2,negated_conjecture,
    ~ ? [X0: $int] : $lesseq(12,X0),
    inference(negated_conjecture,[],[f1]) ).

tff(f1,conjecture,
    ? [X0: $int] : $lesseq(12,X0),
    file('/export/starexec/sandbox/benchmark/theBenchmark.p',prove_12_lesseq_something) ).

%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.03/0.10  % Problem    : ARI018_1 : TPTP v8.2.0. Released v5.0.0.
% 0.03/0.11  % 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.10/0.30  % Computer : n032.cluster.edu
% 0.10/0.30  % Model    : x86_64 x86_64
% 0.10/0.30  % CPU      : Intel(R) Xeon(R) CPU E5-2620 v4 @ 2.10GHz
% 0.10/0.30  % Memory   : 8042.1875MB
% 0.10/0.30  % OS       : Linux 3.10.0-693.el7.x86_64
% 0.10/0.30  % CPULimit   : 300
% 0.10/0.30  % WCLimit    : 300
% 0.10/0.30  % DateTime   : Sun May 19 13:28:37 EDT 2024
% 0.10/0.30  % CPUTime    : 
% 0.10/0.30  This is a TF0_THM_NEQ_ARI problem
% 0.10/0.30  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.43/0.59  % (31600)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 (2997ds/34Mi)
% 0.43/0.59  % (31603)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 (2997ds/56Mi)
% 0.43/0.59  % (31596)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 (2997ds/34Mi)
% 0.43/0.59  % (31598)lrs+1011_1:1_sil=8000:sp=occurrence:nwc=10.0:i=78:ss=axioms:sgt=8_0 on theBenchmark for (2997ds/78Mi)
% 0.43/0.59  % (31600)Also succeeded, but the first one will report.
% 0.43/0.59  % (31596)Also succeeded, but the first one will report.
% 0.43/0.59  % (31603)First to succeed.
% 0.43/0.59  % (31603)Solution written to "/export/starexec/sandbox/tmp/vampire-proof-31595"
% 0.43/0.59  % (31599)ott+1011_1:1_sil=2000:urr=on:i=33:sd=1:kws=inv_frequency:ss=axioms:sup=off_0 on theBenchmark for (2997ds/33Mi)
% 0.43/0.59  % (31601)lrs+1002_1:16_to=lpo:sil=32000:sp=unary_frequency:sos=on:i=45:bd=off:ss=axioms_0 on theBenchmark for (2997ds/45Mi)
% 0.43/0.59  % (31602)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 (2997ds/83Mi)
% 0.43/0.59  % (31597)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 (2997ds/51Mi)
% 0.43/0.59  % (31603)Refutation found. Thanks to Tanya!
% 0.43/0.59  % SZS status Theorem for theBenchmark
% 0.43/0.59  % SZS output start Proof for theBenchmark
% See solution above
% 0.43/0.59  % (31603)------------------------------
% 0.43/0.59  % (31603)Version: Vampire 4.8 (commit 3a798227e on 2024-05-03 07:42:47 +0200)
% 0.43/0.59  % (31603)Termination reason: Refutation
% 0.43/0.59  
% 0.43/0.59  % (31603)Memory used [KB]: 972
% 0.43/0.59  % (31603)Time elapsed: 0.002 s
% 0.43/0.59  % (31603)Instructions burned: 2 (million)
% 0.43/0.59  % (31595)Success in time 0.282 s
% 0.43/0.59  % Vampire---4.8 exiting
%------------------------------------------------------------------------------