TSTP Solution File: ARI601_1 by Vampire---4.8
View Problem
- Process Solution
%------------------------------------------------------------------------------
% File : Vampire---4.8
% Problem : ARI601_1 : TPTP v8.1.2. 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 : n026.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 : Sun May 5 04:34:11 EDT 2024
% Result : Theorem 0.59s 0.76s
% Output : Refutation 0.59s
% Verified :
% SZS Type : Refutation
% Derivation depth : 9
% Number of leaves : 6
% Syntax : Number of formulae : 18 ( 8 unt; 2 typ; 0 def)
% Number of atoms : 30 ( 0 equ)
% Maximal formula atoms : 3 ( 1 avg)
% Number of connectives : 26 ( 12 ~; 4 |; 4 &)
% ( 0 <=>; 6 =>; 0 <=; 0 <~>)
% Maximal formula depth : 7 ( 3 avg)
% Maximal term depth : 3 ( 1 avg)
% Number arithmetic : 80 ( 29 atm; 11 fun; 27 num; 13 var)
% Number of types : 1 ( 0 usr; 1 ari)
% Number of type conns : 1 ( 1 >; 0 *; 0 +; 0 <<)
% Number of predicates : 3 ( 0 usr; 1 prp; 0-2 aty)
% Number of functors : 6 ( 2 usr; 4 con; 0-2 aty)
% Number of variables : 13 ( 13 !; 0 ?; 13 :)
% Comments :
%------------------------------------------------------------------------------
tff(func_def_0,type,
a: $int ).
tff(func_def_1,type,
f: $int > $int ).
tff(f43,plain,
$false,
inference(subsumption_resolution,[],[f33,f30]) ).
tff(f30,plain,
$less(4,$sum(a,1)),
inference(unit_resulting_resolution,[],[f29,f13]) ).
tff(f13,plain,
! [X0: $int,X1: $int] :
( $less(X1,$sum(X0,1))
| $less(X0,X1) ),
introduced(theory_axiom_147,[]) ).
tff(f29,plain,
~ $less(a,4),
inference(evaluation,[],[f26]) ).
tff(f26,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/tmp/tmp.jmtA49YMlT/Vampire---4.8_6320',fX_gt_X_implies_ineq) ).
tff(f33,plain,
~ $less(4,$sum(a,1)),
inference(unit_resulting_resolution,[],[f20,f18,f10]) ).
tff(f10,plain,
! [X2: $int,X0: $int,X1: $int] :
( ~ $less(X0,X1)
| ~ $less(X1,X2)
| $less(X0,X2) ),
introduced(theory_axiom_143,[]) ).
tff(f18,plain,
! [X0: $int] : $less(X0,f(X0)),
inference(cnf_transformation,[],[f17]) ).
tff(f20,plain,
~ $less(4,f($sum(a,1))),
inference(cnf_transformation,[],[f17]) ).
%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.08/0.13 % Problem : ARI601_1 : TPTP v8.1.2. Released v5.1.0.
% 0.08/0.15 % 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.16/0.37 % Computer : n026.cluster.edu
% 0.16/0.37 % Model : x86_64 x86_64
% 0.16/0.37 % CPU : Intel(R) Xeon(R) CPU E5-2620 v4 @ 2.10GHz
% 0.16/0.37 % Memory : 8042.1875MB
% 0.16/0.37 % OS : Linux 3.10.0-693.el7.x86_64
% 0.16/0.37 % CPULimit : 300
% 0.16/0.37 % WCLimit : 300
% 0.16/0.37 % DateTime : Fri May 3 21:51:38 EDT 2024
% 0.16/0.37 % CPUTime :
% 0.16/0.37 This is a TF0_THM_NEQ_ARI problem
% 0.16/0.37 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/tmp/tmp.jmtA49YMlT/Vampire---4.8_6320
% 0.59/0.75 % (6436)lrs-21_1:1_to=lpo:sil=2000:sp=frequency:sos=on:lma=on:i=56:sd=2:ss=axioms:ep=R_0 on Vampire---4 for (2996ds/56Mi)
% 0.59/0.76 % (6429)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 Vampire---4 for (2996ds/34Mi)
% 0.59/0.76 % (6430)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 Vampire---4 for (2996ds/51Mi)
% 0.59/0.76 % (6432)ott+1011_1:1_sil=2000:urr=on:i=33:sd=1:kws=inv_frequency:ss=axioms:sup=off_0 on Vampire---4 for (2996ds/33Mi)
% 0.59/0.76 % (6432)First to succeed.
% 0.59/0.76 % (6432)Solution written to "/export/starexec/sandbox2/tmp/vampire-proof-6428"
% 0.59/0.76 % (6432)Refutation found. Thanks to Tanya!
% 0.59/0.76 % SZS status Theorem for Vampire---4
% 0.59/0.76 % SZS output start Proof for Vampire---4
% See solution above
% 0.59/0.76 % (6432)------------------------------
% 0.59/0.76 % (6432)Version: Vampire 4.8 (commit 3a798227e on 2024-05-03 07:42:47 +0200)
% 0.59/0.76 % (6432)Termination reason: Refutation
% 0.59/0.76
% 0.59/0.76 % (6432)Memory used [KB]: 977
% 0.59/0.76 % (6432)Time elapsed: 0.005 s
% 0.59/0.76 % (6432)Instructions burned: 3 (million)
% 0.59/0.76 % (6428)Success in time 0.383 s
% 0.59/0.76 % Vampire---4.8 exiting
%------------------------------------------------------------------------------