TSTP Solution File: SWW600_2 by SnakeForV-SAT---1.0
View Problem
- Process Solution
%------------------------------------------------------------------------------
% File : SnakeForV-SAT---1.0
% Problem : SWW600_2 : TPTP v8.1.0. Released v6.1.0.
% Transfm : none
% Format : tptp:raw
% Command : vampire --input_syntax tptp --proof tptp --output_axiom_names on --mode portfolio --schedule snake_tptp_sat --cores 0 -t %d %s
% Computer : n012.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 Aug 31 19:20:10 EDT 2022
% Result : Theorem 0.20s 0.53s
% Output : Refutation 0.20s
% Verified :
% SZS Type : Refutation
% Derivation depth : 9
% Number of leaves : 40
% Syntax : Number of formulae : 50 ( 3 unt; 37 typ; 0 def)
% Number of atoms : 107 ( 50 equ)
% Maximal formula atoms : 18 ( 8 avg)
% Number of connectives : 154 ( 60 ~; 0 |; 80 &)
% ( 0 <=>; 14 =>; 0 <=; 0 <~>)
% Maximal formula depth : 21 ( 13 avg)
% Maximal term depth : 3 ( 1 avg)
% Number arithmetic : 328 ( 56 atm; 114 fun; 56 num; 102 var)
% Number of types : 6 ( 4 usr; 1 ari)
% Number of type conns : 30 ( 17 >; 13 *; 0 +; 0 <<)
% Number of predicates : 8 ( 4 usr; 1 prp; 0-2 aty)
% Number of functors : 32 ( 29 usr; 17 con; 0-4 aty)
% Number of variables : 102 ( 50 !; 52 ?; 102 :)
% Comments :
%------------------------------------------------------------------------------
tff(type_def_5,type,
uni: $tType ).
tff(type_def_6,type,
ty: $tType ).
tff(type_def_7,type,
bool: $tType ).
tff(type_def_8,type,
tuple0: $tType ).
tff(func_def_0,type,
witness: ty > uni ).
tff(func_def_1,type,
int: ty ).
tff(func_def_2,type,
real: ty ).
tff(func_def_3,type,
bool1: ty ).
tff(func_def_4,type,
true: bool ).
tff(func_def_5,type,
false: bool ).
tff(func_def_6,type,
match_bool: ( ty * bool * uni * uni ) > uni ).
tff(func_def_7,type,
tuple01: ty ).
tff(func_def_8,type,
tuple02: tuple0 ).
tff(func_def_9,type,
qtmark: ty ).
tff(func_def_12,type,
abs: $int > $int ).
tff(func_def_14,type,
div: ( $int * $int ) > $int ).
tff(func_def_15,type,
mod: ( $int * $int ) > $int ).
tff(func_def_22,type,
gcd: ( $int * $int ) > $int ).
tff(func_def_23,type,
ref: ty > ty ).
tff(func_def_24,type,
mk_ref: ( ty * uni ) > uni ).
tff(func_def_25,type,
contents: ( ty * uni ) > uni ).
tff(func_def_27,type,
sK0: ( $int * $int * $int ) > $int ).
tff(func_def_28,type,
sK1: ( $int * $int ) > $int ).
tff(func_def_29,type,
sK2: $int > $int ).
tff(func_def_30,type,
sK3: $int ).
tff(func_def_31,type,
sK4: $int ).
tff(func_def_32,type,
sK5: $int ).
tff(func_def_33,type,
sK6: $int ).
tff(func_def_34,type,
sK7: $int ).
tff(func_def_35,type,
sK8: $int ).
tff(func_def_36,type,
sK9: $int ).
tff(func_def_37,type,
sK10: $int ).
tff(func_def_38,type,
sK11: $int > $int ).
tff(pred_def_1,type,
sort: ( ty * uni ) > $o ).
tff(pred_def_4,type,
divides: ( $int * $int ) > $o ).
tff(pred_def_5,type,
even: $int > $o ).
tff(pred_def_6,type,
odd: $int > $o ).
tff(f449,plain,
$false,
inference(subsumption_resolution,[],[f385,f380]) ).
tff(f380,plain,
! [X8: $int,X9: $int] : ( sK6 != $sum($product(X8,sK4),$product(X9,sK3)) ),
inference(cnf_transformation,[],[f311]) ).
tff(f311,plain,
( ~ $less(sK3,0)
& ( $sum($product(sK5,sK4),$product(sK8,sK3)) = sK6 )
& ~ $less(0,sK9)
& ~ $less(sK6,0)
& ( $sum($product(sK10,sK4),$product(sK7,sK3)) = sK9 )
& ~ $less(sK9,0)
& ! [X8: $int,X9: $int] : ( sK6 != $sum($product(X8,sK4),$product(X9,sK3)) )
& ( gcd(sK6,sK9) = gcd(sK4,sK3) )
& ~ $less(sK4,0) ),
inference(skolemisation,[status(esa),new_symbols(skolem,[sK3,sK4,sK5,sK6,sK7,sK8,sK9,sK10])],[f308,f310,f309]) ).
tff(f309,plain,
( ? [X0: $int,X1: $int] :
( ~ $less(X0,0)
& ? [X2: $int,X3: $int,X4: $int,X5: $int,X6: $int,X7: $int] :
( ( $sum($product(X2,X1),$product(X5,X0)) = X3 )
& ~ $less(0,X6)
& ~ $less(X3,0)
& ( $sum($product(X7,X1),$product(X4,X0)) = X6 )
& ~ $less(X6,0)
& ! [X8: $int,X9: $int] : ( $sum($product(X8,X1),$product(X9,X0)) != X3 )
& ( gcd(X3,X6) = gcd(X1,X0) ) )
& ~ $less(X1,0) )
=> ( ~ $less(sK3,0)
& ? [X7: $int,X6: $int,X5: $int,X4: $int,X3: $int,X2: $int] :
( ( $sum($product(X2,sK4),$product(X5,sK3)) = X3 )
& ~ $less(0,X6)
& ~ $less(X3,0)
& ( $sum($product(X7,sK4),$product(X4,sK3)) = X6 )
& ~ $less(X6,0)
& ! [X9: $int,X8: $int] : ( $sum($product(X8,sK4),$product(X9,sK3)) != X3 )
& ( gcd(X3,X6) = gcd(sK4,sK3) ) )
& ~ $less(sK4,0) ) ),
introduced(choice_axiom,[]) ).
tff(f310,plain,
( ? [X7: $int,X6: $int,X5: $int,X4: $int,X3: $int,X2: $int] :
( ( $sum($product(X2,sK4),$product(X5,sK3)) = X3 )
& ~ $less(0,X6)
& ~ $less(X3,0)
& ( $sum($product(X7,sK4),$product(X4,sK3)) = X6 )
& ~ $less(X6,0)
& ! [X9: $int,X8: $int] : ( $sum($product(X8,sK4),$product(X9,sK3)) != X3 )
& ( gcd(X3,X6) = gcd(sK4,sK3) ) )
=> ( ( $sum($product(sK5,sK4),$product(sK8,sK3)) = sK6 )
& ~ $less(0,sK9)
& ~ $less(sK6,0)
& ( $sum($product(sK10,sK4),$product(sK7,sK3)) = sK9 )
& ~ $less(sK9,0)
& ! [X9: $int,X8: $int] : ( sK6 != $sum($product(X8,sK4),$product(X9,sK3)) )
& ( gcd(sK6,sK9) = gcd(sK4,sK3) ) ) ),
introduced(choice_axiom,[]) ).
tff(f308,plain,
? [X0: $int,X1: $int] :
( ~ $less(X0,0)
& ? [X2: $int,X3: $int,X4: $int,X5: $int,X6: $int,X7: $int] :
( ( $sum($product(X2,X1),$product(X5,X0)) = X3 )
& ~ $less(0,X6)
& ~ $less(X3,0)
& ( $sum($product(X7,X1),$product(X4,X0)) = X6 )
& ~ $less(X6,0)
& ! [X8: $int,X9: $int] : ( $sum($product(X8,X1),$product(X9,X0)) != X3 )
& ( gcd(X3,X6) = gcd(X1,X0) ) )
& ~ $less(X1,0) ),
inference(rectify,[],[f251]) ).
tff(f251,plain,
? [X1: $int,X0: $int] :
( ~ $less(X1,0)
& ? [X6: $int,X7: $int,X2: $int,X5: $int,X4: $int,X3: $int] :
( ( $sum($product(X6,X0),$product(X5,X1)) = X7 )
& ~ $less(0,X4)
& ~ $less(X7,0)
& ( $sum($product(X3,X0),$product(X2,X1)) = X4 )
& ~ $less(X4,0)
& ! [X8: $int,X9: $int] : ( $sum($product(X8,X0),$product(X9,X1)) != X7 )
& ( gcd(X7,X4) = gcd(X0,X1) ) )
& ~ $less(X0,0) ),
inference(flattening,[],[f250]) ).
tff(f250,plain,
? [X1: $int,X0: $int] :
( ? [X3: $int,X6: $int,X2: $int,X5: $int,X4: $int,X7: $int] :
( ! [X8: $int,X9: $int] : ( $sum($product(X8,X0),$product(X9,X1)) != X7 )
& ~ $less(0,X4)
& ~ $less(X7,0)
& ~ $less(X4,0)
& ( gcd(X7,X4) = gcd(X0,X1) )
& ( $sum($product(X3,X0),$product(X2,X1)) = X4 )
& ( $sum($product(X6,X0),$product(X5,X1)) = X7 ) )
& ~ $less(X0,0)
& ~ $less(X1,0) ),
inference(ennf_transformation,[],[f144]) ).
tff(f144,plain,
~ ! [X1: $int,X0: $int] :
( ( ~ $less(X0,0)
& ~ $less(X1,0) )
=> ! [X3: $int,X6: $int,X2: $int,X5: $int,X4: $int,X7: $int] :
( ( ~ $less(X7,0)
& ~ $less(X4,0)
& ( gcd(X7,X4) = gcd(X0,X1) )
& ( $sum($product(X3,X0),$product(X2,X1)) = X4 )
& ( $sum($product(X6,X0),$product(X5,X1)) = X7 ) )
=> ( ~ $less(0,X4)
=> ? [X8: $int,X9: $int] : ( $sum($product(X8,X0),$product(X9,X1)) = X7 ) ) ) ),
inference(rectify,[],[f89]) ).
tff(f89,plain,
~ ! [X1: $int,X7: $int] :
( ( ~ $less(X1,0)
& ~ $less(X7,0) )
=> ! [X8: $int,X12: $int,X14: $int,X11: $int,X0: $int,X2: $int] :
( ( ( $sum($product(X0,X1),$product(X11,X7)) = X2 )
& ( $sum($product(X12,X1),$product(X8,X7)) = X14 )
& ~ $less(X14,0)
& ( gcd(X1,X7) = gcd(X2,X14) )
& ~ $less(X2,0) )
=> ( ~ $less(0,X14)
=> ? [X15: $int,X16: $int] : ( $sum($product(X15,X1),$product(X16,X7)) = X2 ) ) ) ),
inference(theory_normalization,[],[f84]) ).
tff(f84,negated_conjecture,
~ ! [X1: $int,X7: $int] :
( ( $lesseq(0,X1)
& $lesseq(0,X7) )
=> ! [X8: $int,X12: $int,X14: $int,X11: $int,X0: $int,X2: $int] :
( ( ( $sum($product(X0,X1),$product(X11,X7)) = X2 )
& ( $sum($product(X12,X1),$product(X8,X7)) = X14 )
& $lesseq(0,X14)
& ( gcd(X1,X7) = gcd(X2,X14) )
& $lesseq(0,X2) )
=> ( ~ $less(0,X14)
=> ? [X15: $int,X16: $int] : ( $sum($product(X15,X1),$product(X16,X7)) = X2 ) ) ) ),
inference(negated_conjecture,[],[f83]) ).
tff(f83,conjecture,
! [X1: $int,X7: $int] :
( ( $lesseq(0,X1)
& $lesseq(0,X7) )
=> ! [X8: $int,X12: $int,X14: $int,X11: $int,X0: $int,X2: $int] :
( ( ( $sum($product(X0,X1),$product(X11,X7)) = X2 )
& ( $sum($product(X12,X1),$product(X8,X7)) = X14 )
& $lesseq(0,X14)
& ( gcd(X1,X7) = gcd(X2,X14) )
& $lesseq(0,X2) )
=> ( ~ $less(0,X14)
=> ? [X15: $int,X16: $int] : ( $sum($product(X15,X1),$product(X16,X7)) = X2 ) ) ) ),
file('/export/starexec/sandbox/benchmark/theBenchmark.p',wP_parameter_gcd) ).
tff(f385,plain,
$sum($product(sK5,sK4),$product(sK8,sK3)) = sK6,
inference(cnf_transformation,[],[f311]) ).
%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.11/0.12 % Problem : SWW600=2 : TPTP v8.1.0. Released v6.1.0.
% 0.11/0.13 % Command : vampire --input_syntax tptp --proof tptp --output_axiom_names on --mode portfolio --schedule snake_tptp_sat --cores 0 -t %d %s
% 0.12/0.34 % Computer : n012.cluster.edu
% 0.12/0.34 % Model : x86_64 x86_64
% 0.12/0.34 % CPU : Intel(R) Xeon(R) CPU E5-2620 v4 @ 2.10GHz
% 0.12/0.34 % Memory : 8042.1875MB
% 0.12/0.34 % OS : Linux 3.10.0-693.el7.x86_64
% 0.12/0.34 % CPULimit : 300
% 0.12/0.34 % WCLimit : 300
% 0.12/0.34 % DateTime : Tue Aug 30 20:54:05 EDT 2022
% 0.12/0.34 % CPUTime :
% 0.20/0.50 % (22830)dis+2_1:64_add=large:bce=on:bd=off:i=2:si=on:rawr=on:rtra=on_0 on theBenchmark for (2999ds/2Mi)
% 0.20/0.50 % (22830)Instruction limit reached!
% 0.20/0.50 % (22830)------------------------------
% 0.20/0.50 % (22830)Version: Vampire 4.7 (commit 807e37dd9 on 2022-08-23 09:55:27 +0200)
% 0.20/0.50 % (22830)Linked with Z3 4.8.13.0 f03d756e086f81f2596157241e0decfb1c982299 z3-4.8.4-5390-gf03d756e0
% 0.20/0.50 % (22830)Termination reason: Unknown
% 0.20/0.50 % (22830)Termination phase: Property scanning
% 0.20/0.50
% 0.20/0.50 % (22830)Memory used [KB]: 895
% 0.20/0.50 % (22830)Time elapsed: 0.002 s
% 0.20/0.50 % (22830)Instructions burned: 2 (million)
% 0.20/0.50 % (22830)------------------------------
% 0.20/0.50 % (22830)------------------------------
% 0.20/0.50 % (22828)fmb+10_1:1_fmbsr=2.0:nm=4:skr=on:i=51:si=on:rawr=on:rtra=on_0 on theBenchmark for (2999ds/51Mi)
% 0.20/0.51 % (22822)fmb+10_1:1_bce=on:fmbsr=1.5:nm=4:skr=on:i=191324:si=on:rawr=on:rtra=on_0 on theBenchmark for (2999ds/191324Mi)
% 0.20/0.51 % (22844)ott+3_1:1_gsp=on:lcm=predicate:i=138:si=on:rawr=on:rtra=on_0 on theBenchmark for (2999ds/138Mi)
% 0.20/0.51 % (22822)WARNING: trying to run FMB on interpreted or otherwise provably infinite-domain problem!
% 0.20/0.51 % (22822)Terminated due to inappropriate strategy.
% 0.20/0.51 % (22822)------------------------------
% 0.20/0.51 % (22822)Version: Vampire 4.7 (commit 807e37dd9 on 2022-08-23 09:55:27 +0200)
% 0.20/0.51 % (22822)Linked with Z3 4.8.13.0 f03d756e086f81f2596157241e0decfb1c982299 z3-4.8.4-5390-gf03d756e0
% 0.20/0.51 % (22822)Termination reason: Inappropriate
% 0.20/0.51
% 0.20/0.51 % (22822)Memory used [KB]: 1151
% 0.20/0.51 % (22822)Time elapsed: 0.009 s
% 0.20/0.51 % (22822)Instructions burned: 9 (million)
% 0.20/0.51 % (22822)------------------------------
% 0.20/0.51 % (22822)------------------------------
% 0.20/0.52 % (22831)ott-1_1:6_av=off:cond=on:fsr=off:nwc=3.0:i=51:si=on:rawr=on:rtra=on_0 on theBenchmark for (2999ds/51Mi)
% 0.20/0.52 % (22825)ott+10_1:32_bd=off:fsr=off:newcnf=on:tgt=full:i=51:si=on:rawr=on:rtra=on_0 on theBenchmark for (2999ds/51Mi)
% 0.20/0.52 % (22839)dis+34_1:32_abs=on:add=off:bsr=on:gsp=on:sp=weighted_frequency:i=99:si=on:rawr=on:rtra=on_0 on theBenchmark for (2999ds/99Mi)
% 0.20/0.52 % (22824)ott+4_1:1_av=off:bd=off:nwc=5.0:s2a=on:s2at=2.0:slsq=on:slsqc=2:slsql=off:slsqr=1,2:sp=frequency:i=37:si=on:rawr=on:rtra=on_0 on theBenchmark for (2999ds/37Mi)
% 0.20/0.52 % (22827)dis+34_1:32_abs=on:add=off:bsr=on:gsp=on:sp=weighted_frequency:i=48:si=on:rawr=on:rtra=on_0 on theBenchmark for (2999ds/48Mi)
% 0.20/0.52 % (22847)ott+10_1:1_kws=precedence:tgt=ground:i=482:si=on:rawr=on:rtra=on_0 on theBenchmark for (2999ds/482Mi)
% 0.20/0.52 % (22846)ott+11_1:1_drc=off:nwc=5.0:slsq=on:slsqc=1:spb=goal_then_units:to=lpo:i=467:si=on:rawr=on:rtra=on_0 on theBenchmark for (2999ds/467Mi)
% 0.20/0.52 % (22844)First to succeed.
% 0.20/0.52 % (22850)ott+11_2:3_av=off:fde=unused:nwc=5.0:tgt=ground:i=177:si=on:rawr=on:rtra=on_0 on theBenchmark for (2999ds/177Mi)
% 0.20/0.52 % (22823)ott+10_1:32_abs=on:br=off:urr=ec_only:i=50:si=on:rawr=on:rtra=on_0 on theBenchmark for (2999ds/50Mi)
% 0.20/0.53 % (22845)dis+21_1:1_av=off:er=filter:slsq=on:slsqc=0:slsqr=1,1:sp=frequency:to=lpo:i=498:si=on:rawr=on:rtra=on_0 on theBenchmark for (2999ds/498Mi)
% 0.20/0.53 % (22844)Refutation found. Thanks to Tanya!
% 0.20/0.53 % SZS status Theorem for theBenchmark
% 0.20/0.53 % SZS output start Proof for theBenchmark
% See solution above
% 0.20/0.53 % (22844)------------------------------
% 0.20/0.53 % (22844)Version: Vampire 4.7 (commit 807e37dd9 on 2022-08-23 09:55:27 +0200)
% 0.20/0.53 % (22844)Linked with Z3 4.8.13.0 f03d756e086f81f2596157241e0decfb1c982299 z3-4.8.4-5390-gf03d756e0
% 0.20/0.53 % (22844)Termination reason: Refutation
% 0.20/0.53
% 0.20/0.53 % (22844)Memory used [KB]: 5756
% 0.20/0.53 % (22844)Time elapsed: 0.016 s
% 0.20/0.53 % (22844)Instructions burned: 13 (million)
% 0.20/0.53 % (22844)------------------------------
% 0.20/0.53 % (22844)------------------------------
% 0.20/0.53 % (22818)Success in time 0.177 s
%------------------------------------------------------------------------------