TSTP Solution File: ARI529_1 by Vampire---4.8
View Problem
- Process Solution
%------------------------------------------------------------------------------
% File : Vampire---4.8
% Problem : ARI529_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/sandbox2/solver/bin/quickGreedyProduceRating_steal_pow3.txt --cores 8 -m 12000 -t %d %s
% Computer : n028.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:47:49 EDT 2024
% Result : Theorem 0.61s 0.80s
% Output : Refutation 0.61s
% Verified :
% SZS Type : Refutation
% Derivation depth : 5
% Number of leaves : 3
% Syntax : Number of formulae : 8 ( 6 unt; 2 typ; 0 def)
% Number of atoms : 6 ( 0 equ)
% Maximal formula atoms : 1 ( 1 avg)
% Number of connectives : 4 ( 4 ~; 0 |; 0 &)
% ( 0 <=>; 0 =>; 0 <=; 0 <~>)
% Maximal formula depth : 2 ( 2 avg)
% Maximal term depth : 4 ( 2 avg)
% Number arithmetic : 48 ( 5 atm; 23 fun; 20 num; 0 var)
% Number of types : 3 ( 0 usr; 2 ari)
% Number of type conns : 4 ( 2 >; 2 *; 0 +; 0 <<)
% Number of predicates : 4 ( 2 usr; 1 prp; 0-2 aty)
% Number of functors : 9 ( 0 usr; 4 con; 0-2 aty)
% Number of variables : 0 ( 0 !; 0 ?; 0 :)
% Comments :
%------------------------------------------------------------------------------
tff(pred_def_3,type,
sQ0_eqProxy: ( $int * $int ) > $o ).
tff(pred_def_4,type,
sQ1_eqProxy: ( $real * $real ) > $o ).
tff(f50,plain,
$false,
inference(evaluation,[],[f34]) ).
tff(f34,plain,
~ $less($to_int($sum(10.0,$uminus(0.0001))),$product($to_int(11/2),2)),
inference(cnf_transformation,[],[f33]) ).
tff(f33,plain,
~ $less($to_int($sum(10.0,$uminus(0.0001))),$product($to_int(11/2),2)),
inference(flattening,[],[f3]) ).
tff(f3,plain,
~ $less($to_int($sum(10.0,$uminus(0.0001))),$product($to_int(11/2),2)),
inference(theory_normalization,[],[f2]) ).
tff(f2,negated_conjecture,
~ $less($to_int($difference(10.0,0.0001)),$product($to_int(11/2),2)),
inference(negated_conjecture,[],[f1]) ).
tff(f1,conjecture,
$less($to_int($difference(10.0,0.0001)),$product($to_int(11/2),2)),
file('/export/starexec/sandbox2/benchmark/theBenchmark.p',mixed_types_problem_34) ).
%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.03/0.12 % Problem : ARI529_1 : TPTP v8.2.0. Released v5.0.0.
% 0.03/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.14/0.34 % Computer : n028.cluster.edu
% 0.14/0.34 % Model : x86_64 x86_64
% 0.14/0.34 % CPU : Intel(R) Xeon(R) CPU E5-2620 v4 @ 2.10GHz
% 0.14/0.34 % Memory : 8042.1875MB
% 0.14/0.34 % OS : Linux 3.10.0-693.el7.x86_64
% 0.14/0.34 % CPULimit : 300
% 0.14/0.34 % WCLimit : 300
% 0.14/0.34 % DateTime : Sun May 19 13:14:23 EDT 2024
% 0.14/0.34 % CPUTime :
% 0.14/0.34 This is a TF0_THM_NEQ_ARI problem
% 0.14/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.61/0.79 % (12735)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 (2995ds/56Mi)
% 0.61/0.80 % (12735)First to succeed.
% 0.61/0.80 % (12728)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 (2995ds/34Mi)
% 0.61/0.80 % (12730)lrs+1011_1:1_sil=8000:sp=occurrence:nwc=10.0:i=78:ss=axioms:sgt=8_0 on theBenchmark for (2995ds/78Mi)
% 0.61/0.80 % (12732)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 (2995ds/34Mi)
% 0.61/0.80 % (12735)Solution written to "/export/starexec/sandbox2/tmp/vampire-proof-12727"
% 0.61/0.80 % (12731)ott+1011_1:1_sil=2000:urr=on:i=33:sd=1:kws=inv_frequency:ss=axioms:sup=off_0 on theBenchmark for (2995ds/33Mi)
% 0.61/0.80 % (12735)Refutation found. Thanks to Tanya!
% 0.61/0.80 % SZS status Theorem for theBenchmark
% 0.61/0.80 % SZS output start Proof for theBenchmark
% See solution above
% 0.61/0.80 % (12735)------------------------------
% 0.61/0.80 % (12735)Version: Vampire 4.8 (commit 3a798227e on 2024-05-03 07:42:47 +0200)
% 0.61/0.80 % (12735)Termination reason: Refutation
% 0.61/0.80
% 0.61/0.80 % (12735)Memory used [KB]: 964
% 0.61/0.80 % (12735)Time elapsed: 0.002 s
% 0.61/0.80 % (12735)Instructions burned: 3 (million)
% 0.61/0.80 % (12727)Success in time 0.446 s
% 0.61/0.80 % Vampire---4.8 exiting
%------------------------------------------------------------------------------