TSTP Solution File: ARI622_1 by Vampire-SAT---4.8
View Problem
- Process Solution
%------------------------------------------------------------------------------
% File : Vampire-SAT---4.8
% Problem : ARI622_1 : TPTP v8.2.0. Released v5.1.0.
% Transfm : none
% Format : tptp:raw
% Command : vampire --mode casc_sat -m 16384 --cores 7 -t %d %s
% Computer : n007.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:50:50 EDT 2024
% Result : Theorem 0.22s 0.55s
% Output : Refutation 0.22s
% Verified :
% SZS Type : Refutation
% Derivation depth : 20
% Number of leaves : 6
% Syntax : Number of formulae : 35 ( 10 unt; 3 typ; 0 def)
% Number of atoms : 138 ( 42 equ)
% Maximal formula atoms : 10 ( 4 avg)
% Number of connectives : 158 ( 52 ~; 50 |; 44 &)
% ( 7 <=>; 5 =>; 0 <=; 0 <~>)
% Maximal formula depth : 9 ( 5 avg)
% Maximal term depth : 3 ( 1 avg)
% Number arithmetic : 190 ( 19 atm; 35 fun; 85 num; 51 var)
% Number of types : 2 ( 0 usr; 1 ari)
% Number of type conns : 3 ( 3 >; 0 *; 0 +; 0 <<)
% Number of predicates : 6 ( 2 usr; 1 prp; 0-2 aty)
% Number of functors : 8 ( 1 usr; 5 con; 0-2 aty)
% Number of variables : 51 ( 33 !; 18 ?; 51 :)
% Comments :
%------------------------------------------------------------------------------
tff(func_def_7,type,
sK1: $int > $int ).
tff(pred_def_1,type,
pow2: $int > $o ).
tff(pred_def_4,type,
sP0: $int > $o ).
tff(f12347,plain,
$false,
inference(evaluation,[],[f12334]) ).
tff(f12334,plain,
10 != $sum(8,2),
inference(unit_resulting_resolution,[],[f12287,f12325,f40]) ).
tff(f40,plain,
! [X0: $int,X1: $int] :
( ~ pow2(X1)
| ( $sum(X0,X1) != 10 )
| ~ pow2(X0) ),
inference(cnf_transformation,[],[f32]) ).
tff(f32,plain,
( ! [X0: $int,X1: $int] :
( ( $sum(X0,X1) != 10 )
| ~ pow2(X1)
| ~ pow2(X0) )
& ! [X2: $int] :
( ( pow2(X2)
| ~ sP0(X2) )
& ( sP0(X2)
| ~ pow2(X2) ) ) ),
inference(rectify,[],[f31]) ).
tff(f31,plain,
( ! [X2: $int,X3: $int] :
( ( 10 != $sum(X2,X3) )
| ~ pow2(X3)
| ~ pow2(X2) )
& ! [X0: $int] :
( ( pow2(X0)
| ~ sP0(X0) )
& ( sP0(X0)
| ~ pow2(X0) ) ) ),
inference(nnf_transformation,[],[f25]) ).
tff(f25,plain,
( ! [X2: $int,X3: $int] :
( ( 10 != $sum(X2,X3) )
| ~ pow2(X3)
| ~ pow2(X2) )
& ! [X0: $int] :
( pow2(X0)
<=> sP0(X0) ) ),
inference(definition_folding,[],[f23,f24]) ).
tff(f24,plain,
! [X0: $int] :
( sP0(X0)
<=> ( ( ? [X1: $int] :
( pow2(X1)
& ( $product(2,X1) = X0 ) )
& ~ $less(X0,2) )
| ( 1 = X0 ) ) ),
introduced(predicate_definition_introduction,[new_symbols(naming,[sP0])]) ).
tff(f23,plain,
( ! [X2: $int,X3: $int] :
( ( 10 != $sum(X2,X3) )
| ~ pow2(X3)
| ~ pow2(X2) )
& ! [X0: $int] :
( pow2(X0)
<=> ( ( ? [X1: $int] :
( pow2(X1)
& ( $product(2,X1) = X0 ) )
& ~ $less(X0,2) )
| ( 1 = X0 ) ) ) ),
inference(ennf_transformation,[],[f22]) ).
tff(f22,plain,
~ ( ! [X0: $int] :
( pow2(X0)
<=> ( ( ? [X1: $int] :
( pow2(X1)
& ( $product(2,X1) = X0 ) )
& ~ $less(X0,2) )
| ( 1 = X0 ) ) )
=> ? [X2: $int,X3: $int] :
( ( 10 = $sum(X2,X3) )
& pow2(X3)
& pow2(X2) ) ),
inference(rectify,[],[f3]) ).
tff(f3,plain,
~ ( ! [X0: $int] :
( pow2(X0)
<=> ( ( ? [X1: $int] :
( pow2(X1)
& ( $product(2,X1) = X0 ) )
& ~ $less(X0,2) )
| ( 1 = X0 ) ) )
=> ? [X0: $int,X1: $int] :
( ( $sum(X0,X1) = 10 )
& pow2(X1)
& pow2(X0) ) ),
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 ) ) )
=> ? [X0: $int,X1: $int] :
( ( $sum(X0,X1) = 10 )
& pow2(X1)
& pow2(X0) ) ),
inference(negated_conjecture,[],[f1]) ).
tff(f1,conjecture,
( ! [X0: $int] :
( pow2(X0)
<=> ( ( ? [X1: $int] :
( pow2(X1)
& ( $product(2,X1) = X0 ) )
& $lesseq(2,X0) )
| ( 1 = X0 ) ) )
=> ? [X0: $int,X1: $int] :
( ( $sum(X0,X1) = 10 )
& pow2(X1)
& pow2(X0) ) ),
file('/export/starexec/sandbox2/benchmark/theBenchmark.p',sum_of_pows_of_2_eq_10) ).
tff(f12325,plain,
pow2(8),
inference(unit_resulting_resolution,[],[f12324,f39]) ).
tff(f39,plain,
! [X2: $int] :
( ~ sP0(X2)
| pow2(X2) ),
inference(cnf_transformation,[],[f32]) ).
tff(f12324,plain,
sP0(8),
inference(evaluation,[],[f12320]) ).
tff(f12320,plain,
( sP0($product(2,4))
| $less($product(2,4),2) ),
inference(resolution,[],[f12305,f42]) ).
tff(f42,plain,
! [X1: $int] :
( ~ pow2(X1)
| sP0($product(2,X1))
| $less($product(2,X1),2) ),
inference(equality_resolution,[],[f37]) ).
tff(f37,plain,
! [X0: $int,X1: $int] :
( sP0(X0)
| ~ pow2(X1)
| ( $product(2,X1) != X0 )
| $less(X0,2) ),
inference(cnf_transformation,[],[f30]) ).
tff(f30,plain,
! [X0: $int] :
( ( sP0(X0)
| ( ( ! [X1: $int] :
( ~ pow2(X1)
| ( $product(2,X1) != X0 ) )
| $less(X0,2) )
& ( 1 != X0 ) ) )
& ( ( pow2(sK1(X0))
& ( $product(2,sK1(X0)) = X0 )
& ~ $less(X0,2) )
| ( 1 = X0 )
| ~ sP0(X0) ) ),
inference(skolemisation,[status(esa),new_symbols(skolem,[sK1])],[f28,f29]) ).
tff(f29,plain,
! [X0: $int] :
( ? [X2: $int] :
( pow2(X2)
& ( $product(2,X2) = X0 ) )
=> ( pow2(sK1(X0))
& ( $product(2,sK1(X0)) = X0 ) ) ),
introduced(choice_axiom,[]) ).
tff(f28,plain,
! [X0: $int] :
( ( sP0(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 )
| ~ sP0(X0) ) ),
inference(rectify,[],[f27]) ).
tff(f27,plain,
! [X0: $int] :
( ( sP0(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 )
| ~ sP0(X0) ) ),
inference(flattening,[],[f26]) ).
tff(f26,plain,
! [X0: $int] :
( ( sP0(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 )
| ~ sP0(X0) ) ),
inference(nnf_transformation,[],[f24]) ).
tff(f12305,plain,
pow2(4),
inference(unit_resulting_resolution,[],[f12304,f39]) ).
tff(f12304,plain,
sP0(4),
inference(evaluation,[],[f12300]) ).
tff(f12300,plain,
( sP0($product(2,2))
| $less($product(2,2),2) ),
inference(resolution,[],[f12287,f42]) ).
tff(f12287,plain,
pow2(2),
inference(unit_resulting_resolution,[],[f12286,f39]) ).
tff(f12286,plain,
sP0(2),
inference(evaluation,[],[f12285]) ).
tff(f12285,plain,
( sP0($product(2,1))
| $less($product(2,1),2) ),
inference(resolution,[],[f42,f44]) ).
tff(f44,plain,
pow2(1),
inference(unit_resulting_resolution,[],[f43,f39]) ).
tff(f43,plain,
sP0(1),
inference(equality_resolution,[],[f36]) ).
tff(f36,plain,
! [X0: $int] :
( sP0(X0)
| ( 1 != X0 ) ),
inference(cnf_transformation,[],[f30]) ).
%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.07/0.13 % Problem : ARI622_1 : TPTP v8.2.0. Released v5.1.0.
% 0.07/0.15 % Command : vampire --mode casc_sat -m 16384 --cores 7 -t %d %s
% 0.15/0.36 % Computer : n007.cluster.edu
% 0.15/0.36 % Model : x86_64 x86_64
% 0.15/0.36 % CPU : Intel(R) Xeon(R) CPU E5-2620 v4 @ 2.10GHz
% 0.15/0.36 % Memory : 8042.1875MB
% 0.15/0.36 % OS : Linux 3.10.0-693.el7.x86_64
% 0.15/0.36 % CPULimit : 300
% 0.15/0.36 % WCLimit : 300
% 0.15/0.36 % DateTime : Sun May 19 13:26:23 EDT 2024
% 0.15/0.36 % CPUTime :
% 0.15/0.37 % (22743)Running in auto input_syntax mode. Trying TPTP
% 0.15/0.38 % (22748)WARNING: value z3 for option sas not known
% 0.15/0.38 % (22747)fmb+10_1_bce=on:fmbdsb=on:fmbes=contour:fmbswr=3:fde=none:nm=0_793 on theBenchmark for (793ds/0Mi)
% 0.15/0.38 % (22748)dis+2_11_add=large:afr=on:amm=off:bd=off:bce=on:fsd=off:fde=none:gs=on:gsaa=full_model:gsem=off:irw=on:msp=off:nm=4:nwc=1.3:sas=z3:sims=off:sac=on:sp=reverse_arity_569 on theBenchmark for (569ds/0Mi)
% 0.15/0.38 % (22750)ott+10_10:1_add=off:afr=on:amm=off:anc=all:bd=off:bs=on:fsr=off:irw=on:lma=on:msp=off:nm=4:nwc=4.0:sac=on:sp=reverse_frequency_531 on theBenchmark for (531ds/0Mi)
% 0.15/0.38 % (22749)fmb+10_1_bce=on:fmbsr=1.5:nm=32_533 on theBenchmark for (533ds/0Mi)
% 0.15/0.38 % (22746)fmb+10_1_bce=on:fmbas=function:fmbsr=1.2:fde=unused:nm=0_846 on theBenchmark for (846ds/0Mi)
% 0.15/0.38 % (22752)ott+1_64_av=off:bd=off:bce=on:fsd=off:fde=unused:gsp=on:irw=on:lcm=predicate:lma=on:nm=2:nwc=1.1:sims=off:urr=on_497 on theBenchmark for (497ds/0Mi)
% 0.15/0.38 % (22751)ott-10_8_av=off:bd=preordered:bs=on:fsd=off:fsr=off:fde=unused:irw=on:lcm=predicate:lma=on:nm=4:nwc=1.7:sp=frequency_522 on theBenchmark for (522ds/0Mi)
% 0.15/0.38 % (22747)WARNING: trying to run FMB on interpreted or otherwise provably infinite-domain problem!
% 0.15/0.38 % (22749)WARNING: trying to run FMB on interpreted or otherwise provably infinite-domain problem!
% 0.15/0.38 % (22747)Terminated due to inappropriate strategy.
% 0.15/0.38 % (22747)------------------------------
% 0.15/0.38 % (22747)Version: Vampire 4.8 (commit 3a798227e on 2024-05-03 07:42:47 +0200)
% 0.15/0.38 % (22747)Termination reason: Inappropriate
% 0.15/0.38
% 0.15/0.38 % (22747)Memory used [KB]: 729
% 0.15/0.38 % (22747)Time elapsed: 0.003 s
% 0.15/0.38 % (22749)Terminated due to inappropriate strategy.
% 0.15/0.38 % (22749)------------------------------
% 0.15/0.38 % (22749)Version: Vampire 4.8 (commit 3a798227e on 2024-05-03 07:42:47 +0200)
% 0.15/0.38 % (22749)Termination reason: Inappropriate
% 0.15/0.38 % (22747)Instructions burned: 2 (million)
% 0.15/0.38
% 0.15/0.38 % (22749)Memory used [KB]: 728
% 0.15/0.38 % (22749)Time elapsed: 0.003 s
% 0.15/0.38 % (22749)Instructions burned: 2 (million)
% 0.15/0.38 % (22746)WARNING: trying to run FMB on interpreted or otherwise provably infinite-domain problem!
% 0.15/0.38 % (22746)Terminated due to inappropriate strategy.
% 0.15/0.38 % (22746)------------------------------
% 0.15/0.38 % (22746)Version: Vampire 4.8 (commit 3a798227e on 2024-05-03 07:42:47 +0200)
% 0.15/0.38 % (22746)Termination reason: Inappropriate
% 0.15/0.38
% 0.15/0.38 % (22746)Memory used [KB]: 728
% 0.15/0.38 % (22746)Time elapsed: 0.002 s
% 0.15/0.38 % (22746)Instructions burned: 2 (million)
% 0.15/0.38 % (22749)------------------------------
% 0.15/0.38 % (22749)------------------------------
% 0.15/0.38 % (22747)------------------------------
% 0.15/0.38 % (22747)------------------------------
% 0.15/0.38 % (22746)------------------------------
% 0.15/0.38 % (22746)------------------------------
% 0.15/0.40 % (22758)fmb+10_1_fmbas=expand:fmbsr=1.1:gsp=on:nm=4_411 on theBenchmark for (411ds/0Mi)
% 0.15/0.40 % (22759)ott+1_9_av=off:bd=off:bs=on:gsp=on:lcm=predicate:nm=4:sp=weighted_frequency:urr=on_382 on theBenchmark for (382ds/0Mi)
% 0.15/0.40 % (22760)lrs-11_2:5_fsd=off:fde=none:nm=4:nwc=5.0:sims=off:sp=reverse_weighted_frequency:stl=62_367 on theBenchmark for (367ds/0Mi)
% 0.15/0.40 % (22758)WARNING: trying to run FMB on interpreted or otherwise provably infinite-domain problem!
% 0.15/0.40 % (22758)Terminated due to inappropriate strategy.
% 0.15/0.40 % (22758)------------------------------
% 0.15/0.40 % (22758)Version: Vampire 4.8 (commit 3a798227e on 2024-05-03 07:42:47 +0200)
% 0.15/0.40 % (22758)Termination reason: Inappropriate
% 0.15/0.40
% 0.15/0.40 % (22758)Memory used [KB]: 728
% 0.15/0.40 % (22758)Time elapsed: 0.002 s
% 0.15/0.40 % (22758)Instructions burned: 2 (million)
% 0.15/0.40 % (22758)------------------------------
% 0.15/0.40 % (22758)------------------------------
% 0.22/0.42 % (22768)ott+4_64_acc=on:anc=none:bs=on:bsr=on:fsd=off:gs=on:gsem=off:irw=on:msp=off:nwc=2.5:nicw=on:sims=off_354 on theBenchmark for (354ds/0Mi)
% 0.22/0.55 % (22759)First to succeed.
% 0.22/0.55 % (22759)Solution written to "/export/starexec/sandbox2/tmp/vampire-proof-22743"
% 0.22/0.55 % (22759)Refutation found. Thanks to Tanya!
% 0.22/0.55 % SZS status Theorem for theBenchmark
% 0.22/0.55 % SZS output start Proof for theBenchmark
% See solution above
% 0.22/0.55 % (22759)------------------------------
% 0.22/0.55 % (22759)Version: Vampire 4.8 (commit 3a798227e on 2024-05-03 07:42:47 +0200)
% 0.22/0.55 % (22759)Termination reason: Refutation
% 0.22/0.55
% 0.22/0.55 % (22759)Memory used [KB]: 2180
% 0.22/0.55 % (22759)Time elapsed: 0.153 s
% 0.22/0.55 % (22759)Instructions burned: 396 (million)
% 0.22/0.55 % (22743)Success in time 0.183 s
%------------------------------------------------------------------------------