TSTP Solution File: ARI620_1 by Vampire---4.8
View Problem
- Process Solution
%------------------------------------------------------------------------------
% File : Vampire---4.8
% Problem : ARI620_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 : n029.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 : Wed May 1 02:09:34 EDT 2024
% Result : Theorem 0.63s 0.80s
% Output : Refutation 0.63s
% Verified :
% SZS Type : Refutation
% Derivation depth : 17
% Number of leaves : 9
% Syntax : Number of formulae : 37 ( 7 unt; 2 typ; 0 def)
% Number of atoms : 125 ( 29 equ)
% Maximal formula atoms : 11 ( 3 avg)
% Number of connectives : 144 ( 54 ~; 49 |; 31 &)
% ( 6 <=>; 4 =>; 0 <=; 0 <~>)
% Maximal formula depth : 10 ( 5 avg)
% Maximal term depth : 3 ( 1 avg)
% Number arithmetic : 161 ( 24 atm; 24 fun; 80 num; 33 var)
% Number of types : 2 ( 0 usr; 1 ari)
% Number of type conns : 2 ( 2 >; 0 *; 0 +; 0 <<)
% Number of predicates : 7 ( 3 usr; 3 prp; 0-2 aty)
% Number of functors : 6 ( 1 usr; 4 con; 0-2 aty)
% Number of variables : 33 ( 25 !; 8 ?; 33 :)
% Comments :
%------------------------------------------------------------------------------
tff(func_def_7,type,
sK0: $int > $int ).
tff(pred_def_1,type,
pow2: $int > $o ).
tff(f746,plain,
$false,
inference(avatar_sat_refutation,[],[f49,f51,f685]) ).
tff(f685,plain,
~ spl1_1,
inference(avatar_contradiction_clause,[],[f667]) ).
tff(f667,plain,
( $false
| ~ spl1_1 ),
inference(resolution,[],[f599,f33]) ).
tff(f33,plain,
~ pow2(8),
inference(cnf_transformation,[],[f27]) ).
tff(f27,plain,
( ~ pow2(8)
& ! [X0: $int] :
( ( pow2(X0)
| ( ( ! [X1: $int] :
( ~ pow2(X1)
| ( $product(2,X1) != X0 ) )
| $less(X0,2) )
& ( 1 != X0 ) ) )
& ( ( pow2(sK0(X0))
& ( $product(2,sK0(X0)) = X0 )
& ~ $less(X0,2) )
| ( 1 = X0 )
| ~ pow2(X0) ) ) ),
inference(skolemisation,[status(esa),new_symbols(skolem,[sK0])],[f25,f26]) ).
tff(f26,plain,
! [X0: $int] :
( ? [X2: $int] :
( pow2(X2)
& ( $product(2,X2) = X0 ) )
=> ( pow2(sK0(X0))
& ( $product(2,sK0(X0)) = X0 ) ) ),
introduced(choice_axiom,[]) ).
tff(f25,plain,
( ~ pow2(8)
& ! [X0: $int] :
( ( pow2(X0)
| ( ( ! [X1: $int] :
( ~ pow2(X1)
| ( $product(2,X1) != X0 ) )
| $less(X0,2) )
& ( 1 != X0 ) ) )
& ( ( ? [X2: $int] :
( pow2(X2)
& ( $product(2,X2) = X0 ) )
& ~ $less(X0,2) )
| ( 1 = X0 )
| ~ pow2(X0) ) ) ),
inference(rectify,[],[f24]) ).
tff(f24,plain,
( ~ pow2(8)
& ! [X0: $int] :
( ( pow2(X0)
| ( ( ! [X1: $int] :
( ~ pow2(X1)
| ( $product(2,X1) != X0 ) )
| $less(X0,2) )
& ( 1 != X0 ) ) )
& ( ( ? [X1: $int] :
( pow2(X1)
& ( $product(2,X1) = X0 ) )
& ~ $less(X0,2) )
| ( 1 = X0 )
| ~ pow2(X0) ) ) ),
inference(flattening,[],[f23]) ).
tff(f23,plain,
( ~ pow2(8)
& ! [X0: $int] :
( ( pow2(X0)
| ( ( ! [X1: $int] :
( ~ pow2(X1)
| ( $product(2,X1) != X0 ) )
| $less(X0,2) )
& ( 1 != X0 ) ) )
& ( ( ? [X1: $int] :
( pow2(X1)
& ( $product(2,X1) = X0 ) )
& ~ $less(X0,2) )
| ( 1 = X0 )
| ~ pow2(X0) ) ) ),
inference(nnf_transformation,[],[f22]) ).
tff(f22,plain,
( ~ pow2(8)
& ! [X0: $int] :
( pow2(X0)
<=> ( ( ? [X1: $int] :
( pow2(X1)
& ( $product(2,X1) = X0 ) )
& ~ $less(X0,2) )
| ( 1 = X0 ) ) ) ),
inference(ennf_transformation,[],[f3]) ).
tff(f3,plain,
~ ( ! [X0: $int] :
( pow2(X0)
<=> ( ( ? [X1: $int] :
( pow2(X1)
& ( $product(2,X1) = X0 ) )
& ~ $less(X0,2) )
| ( 1 = X0 ) ) )
=> pow2(8) ),
inference(theory_normalization,[],[f2]) ).
tff(f2,negated_conjecture,
~ ( ! [X0: $int] :
( pow2(X0)
<=> ( ( ? [X1: $int] :
( pow2(X1)
& ( $product(2,X1) = X0 ) )
& $lesseq(2,X0) )
| ( 1 = X0 ) ) )
=> pow2(8) ),
inference(negated_conjecture,[],[f1]) ).
tff(f1,conjecture,
( ! [X0: $int] :
( pow2(X0)
<=> ( ( ? [X1: $int] :
( pow2(X1)
& ( $product(2,X1) = X0 ) )
& $lesseq(2,X0) )
| ( 1 = X0 ) ) )
=> pow2(8) ),
file('/export/starexec/sandbox2/tmp/tmp.f8De8FoHXh/Vampire---4.8_5193',pow_of_2_8) ).
tff(f599,plain,
( pow2(8)
| ~ spl1_1 ),
inference(evaluation,[],[f598]) ).
tff(f598,plain,
( ~ $less(2,$product(2,4))
| pow2($product(2,4))
| ~ spl1_1 ),
inference(resolution,[],[f589,f578]) ).
tff(f578,plain,
! [X0: $int] :
( ~ pow2(X0)
| ~ $less(2,$product(2,X0))
| pow2($product(2,X0)) ),
inference(resolution,[],[f179,f35]) ).
tff(f35,plain,
! [X1: $int] :
( $less($product(2,X1),2)
| ~ pow2(X1)
| pow2($product(2,X1)) ),
inference(equality_resolution,[],[f32]) ).
tff(f32,plain,
! [X0: $int,X1: $int] :
( pow2(X0)
| ~ pow2(X1)
| ( $product(2,X1) != X0 )
| $less(X0,2) ),
inference(cnf_transformation,[],[f27]) ).
tff(f179,plain,
! [X0: $int,X1: $int] :
( ~ $less(X0,X1)
| ~ $less(X1,X0) ),
inference(resolution,[],[f10,f9]) ).
tff(f9,plain,
! [X0: $int] : ~ $less(X0,X0),
introduced(theory_axiom_142,[]) ).
tff(f10,plain,
! [X2: $int,X0: $int,X1: $int] :
( $less(X0,X2)
| ~ $less(X1,X2)
| ~ $less(X0,X1) ),
introduced(theory_axiom_143,[]) ).
tff(f589,plain,
( pow2(4)
| ~ spl1_1 ),
inference(evaluation,[],[f588]) ).
tff(f588,plain,
( ~ $less(2,$product(2,2))
| pow2($product(2,2))
| ~ spl1_1 ),
inference(resolution,[],[f578,f44]) ).
tff(f44,plain,
( pow2(2)
| ~ spl1_1 ),
inference(avatar_component_clause,[],[f42]) ).
tff(f42,plain,
( spl1_1
<=> pow2(2) ),
introduced(avatar_definition,[new_symbols(naming,[spl1_1])]) ).
tff(f51,plain,
spl1_2,
inference(avatar_contradiction_clause,[],[f50]) ).
tff(f50,plain,
( $false
| spl1_2 ),
inference(resolution,[],[f48,f36]) ).
tff(f36,plain,
pow2(1),
inference(equality_resolution,[],[f31]) ).
tff(f31,plain,
! [X0: $int] :
( pow2(X0)
| ( 1 != X0 ) ),
inference(cnf_transformation,[],[f27]) ).
tff(f48,plain,
( ~ pow2(1)
| spl1_2 ),
inference(avatar_component_clause,[],[f46]) ).
tff(f46,plain,
( spl1_2
<=> pow2(1) ),
introduced(avatar_definition,[new_symbols(naming,[spl1_2])]) ).
tff(f49,plain,
( spl1_1
| ~ spl1_2 ),
inference(avatar_split_clause,[],[f40,f46,f42]) ).
tff(f40,plain,
( ~ pow2(1)
| pow2(2) ),
inference(evaluation,[],[f39]) ).
tff(f39,plain,
( $less(2,2)
| ~ pow2(1)
| pow2(2) ),
inference(superposition,[],[f35,f17]) ).
tff(f17,plain,
! [X0: $int] : ( $product(X0,1) = X0 ),
introduced(theory_axiom_137,[]) ).
%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.07/0.13 % Problem : ARI620_1 : TPTP v8.1.2. Released v5.1.0.
% 0.07/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.35 % Computer : n029.cluster.edu
% 0.14/0.35 % Model : x86_64 x86_64
% 0.14/0.35 % CPU : Intel(R) Xeon(R) CPU E5-2620 v4 @ 2.10GHz
% 0.14/0.35 % Memory : 8042.1875MB
% 0.14/0.35 % OS : Linux 3.10.0-693.el7.x86_64
% 0.14/0.35 % CPULimit : 300
% 0.14/0.35 % WCLimit : 300
% 0.14/0.35 % DateTime : Tue Apr 30 19:12:20 EDT 2024
% 0.14/0.36 % CPUTime :
% 0.14/0.36 This is a TF0_THM_EQU_ARI problem
% 0.14/0.36 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.f8De8FoHXh/Vampire---4.8_5193
% 0.63/0.78 % (5391)lrs+1002_1:16_to=lpo:sil=32000:sp=unary_frequency:sos=on:i=45:bd=off:ss=axioms_0 on Vampire---4 for (2995ds/45Mi)
% 0.63/0.78 % (5386)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 (2995ds/34Mi)
% 0.63/0.78 % (5387)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 (2995ds/51Mi)
% 0.63/0.78 % (5388)lrs+1011_1:1_sil=8000:sp=occurrence:nwc=10.0:i=78:ss=axioms:sgt=8_0 on Vampire---4 for (2995ds/78Mi)
% 0.63/0.78 % (5389)ott+1011_1:1_sil=2000:urr=on:i=33:sd=1:kws=inv_frequency:ss=axioms:sup=off_0 on Vampire---4 for (2995ds/33Mi)
% 0.63/0.78 % (5393)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 (2995ds/56Mi)
% 0.63/0.78 % (5392)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 Vampire---4 for (2995ds/83Mi)
% 0.63/0.78 % (5393)Refutation not found, incomplete strategy% (5393)------------------------------
% 0.63/0.78 % (5393)Version: Vampire 4.8 (commit 8e9376e55 on 2024-01-18 13:49:33 +0100)
% 0.63/0.78 % (5393)Termination reason: Refutation not found, incomplete strategy
% 0.63/0.78
% 0.63/0.78 % (5393)Memory used [KB]: 967
% 0.63/0.78 % (5393)Time elapsed: 0.003 s
% 0.63/0.78 % (5393)Instructions burned: 3 (million)
% 0.63/0.78 % (5393)------------------------------
% 0.63/0.78 % (5393)------------------------------
% 0.63/0.78 % (5390)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 Vampire---4 for (2995ds/34Mi)
% 0.63/0.78 % (5390)Refutation not found, incomplete strategy% (5390)------------------------------
% 0.63/0.78 % (5390)Version: Vampire 4.8 (commit 8e9376e55 on 2024-01-18 13:49:33 +0100)
% 0.63/0.78 % (5390)Termination reason: Refutation not found, incomplete strategy
% 0.63/0.78
% 0.63/0.78 % (5390)Memory used [KB]: 984
% 0.63/0.78 % (5390)Time elapsed: 0.004 s
% 0.63/0.78 % (5390)Instructions burned: 4 (million)
% 0.63/0.78 % (5390)------------------------------
% 0.63/0.78 % (5390)------------------------------
% 0.63/0.78 % (5397)lrs+21_1:16_sil=2000:sp=occurrence:urr=on:flr=on:i=55:sd=1:nm=0:ins=3:ss=included:rawr=on:br=off_0 on Vampire---4 for (2995ds/55Mi)
% 0.63/0.79 % (5398)dis+3_25:4_sil=16000:sos=all:erd=off:i=50:s2at=4.0:bd=off:nm=60:sup=off:cond=on:av=off:ins=2:nwc=10.0:etr=on:to=lpo:s2agt=20:fd=off:bsr=unit_only:slsq=on:slsqr=28,19:awrs=converge:awrsf=500:tgt=ground:bs=unit_only_0 on Vampire---4 for (2995ds/50Mi)
% 0.63/0.79 % (5387)First to succeed.
% 0.63/0.80 % (5387)Refutation found. Thanks to Tanya!
% 0.63/0.80 % SZS status Theorem for Vampire---4
% 0.63/0.80 % SZS output start Proof for Vampire---4
% See solution above
% 0.63/0.80 % (5387)------------------------------
% 0.63/0.80 % (5387)Version: Vampire 4.8 (commit 8e9376e55 on 2024-01-18 13:49:33 +0100)
% 0.63/0.80 % (5387)Termination reason: Refutation
% 0.63/0.80
% 0.63/0.80 % (5387)Memory used [KB]: 1185
% 0.63/0.80 % (5387)Time elapsed: 0.017 s
% 0.63/0.80 % (5387)Instructions burned: 25 (million)
% 0.63/0.80 % (5387)------------------------------
% 0.63/0.80 % (5387)------------------------------
% 0.63/0.80 % (5352)Success in time 0.433 s
% 0.63/0.80 % Vampire---4.8 exiting
%------------------------------------------------------------------------------