TSTP Solution File: SWW600_2 by Vampire---4.8
View Problem
- Process Solution
%------------------------------------------------------------------------------
% File : Vampire---4.8
% Problem : SWW600_2 : TPTP v8.2.0. Released v6.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 : n032.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 : Tue May 21 07:01:39 EDT 2024
% Result : Theorem 0.60s 0.82s
% Output : Refutation 0.60s
% Verified :
% SZS Type : Refutation
% Derivation depth : 8
% Number of leaves : 38
% Syntax : Number of formulae : 47 ( 3 unt; 35 typ; 0 def)
% Number of atoms : 98 ( 46 equ)
% Maximal formula atoms : 18 ( 8 avg)
% Number of connectives : 140 ( 54 ~; 0 |; 72 &)
% ( 0 <=>; 14 =>; 0 <=; 0 <~>)
% Maximal formula depth : 18 ( 12 avg)
% Maximal term depth : 3 ( 1 avg)
% Number arithmetic : 299 ( 51 atm; 105 fun; 51 num; 92 var)
% Number of types : 6 ( 4 usr; 1 ari)
% Number of type conns : 28 ( 15 >; 13 *; 0 +; 0 <<)
% Number of predicates : 8 ( 4 usr; 1 prp; 0-2 aty)
% Number of functors : 30 ( 27 usr; 17 con; 0-4 aty)
% Number of variables : 92 ( 48 !; 44 ?; 92 :)
% 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 ).
tff(func_def_28,type,
sK1: $int ).
tff(func_def_29,type,
sK2: $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 * $int ) > $int ).
tff(func_def_36,type,
sK9: ( $int * $int * $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(f241,plain,
$false,
inference(subsumption_resolution,[],[f200,f203]) ).
tff(f203,plain,
! [X8: $int,X9: $int] : ( $sum($product(X8,sK0),$product(X9,sK1)) != sK7 ),
inference(cnf_transformation,[],[f188]) ).
tff(f188,plain,
( ! [X8: $int,X9: $int] : ( $sum($product(X8,sK0),$product(X9,sK1)) != sK7 )
& ~ $less(0,sK6)
& ( sK6 = $sum($product(sK3,sK0),$product(sK2,sK1)) )
& ( sK7 = $sum($product(sK5,sK0),$product(sK4,sK1)) )
& ( gcd(sK0,sK1) = gcd(sK7,sK6) )
& ~ $less(sK6,0)
& ~ $less(sK7,0)
& ~ $less(sK1,0)
& ~ $less(sK0,0) ),
inference(skolemisation,[status(esa),new_symbols(skolem,[sK0,sK1,sK2,sK3,sK4,sK5,sK6,sK7])],[f160,f187,f186]) ).
tff(f186,plain,
( ? [X0: $int,X1: $int] :
( ? [X2: $int,X3: $int,X4: $int,X5: $int,X6: $int,X7: $int] :
( ! [X8: $int,X9: $int] : ( $sum($product(X8,X0),$product(X9,X1)) != X7 )
& ~ $less(0,X6)
& ( $sum($product(X3,X0),$product(X2,X1)) = X6 )
& ( $sum($product(X5,X0),$product(X4,X1)) = X7 )
& ( gcd(X0,X1) = gcd(X7,X6) )
& ~ $less(X6,0)
& ~ $less(X7,0) )
& ~ $less(X1,0)
& ~ $less(X0,0) )
=> ( ? [X7: $int,X6: $int,X5: $int,X4: $int,X3: $int,X2: $int] :
( ! [X9: $int,X8: $int] : ( $sum($product(X8,sK0),$product(X9,sK1)) != X7 )
& ~ $less(0,X6)
& ( $sum($product(X3,sK0),$product(X2,sK1)) = X6 )
& ( $sum($product(X5,sK0),$product(X4,sK1)) = X7 )
& ( gcd(X7,X6) = gcd(sK0,sK1) )
& ~ $less(X6,0)
& ~ $less(X7,0) )
& ~ $less(sK1,0)
& ~ $less(sK0,0) ) ),
introduced(choice_axiom,[]) ).
tff(f187,plain,
( ? [X7: $int,X6: $int,X5: $int,X4: $int,X3: $int,X2: $int] :
( ! [X9: $int,X8: $int] : ( $sum($product(X8,sK0),$product(X9,sK1)) != X7 )
& ~ $less(0,X6)
& ( $sum($product(X3,sK0),$product(X2,sK1)) = X6 )
& ( $sum($product(X5,sK0),$product(X4,sK1)) = X7 )
& ( gcd(X7,X6) = gcd(sK0,sK1) )
& ~ $less(X6,0)
& ~ $less(X7,0) )
=> ( ! [X9: $int,X8: $int] : ( $sum($product(X8,sK0),$product(X9,sK1)) != sK7 )
& ~ $less(0,sK6)
& ( sK6 = $sum($product(sK3,sK0),$product(sK2,sK1)) )
& ( sK7 = $sum($product(sK5,sK0),$product(sK4,sK1)) )
& ( gcd(sK0,sK1) = gcd(sK7,sK6) )
& ~ $less(sK6,0)
& ~ $less(sK7,0) ) ),
introduced(choice_axiom,[]) ).
tff(f160,plain,
? [X0: $int,X1: $int] :
( ? [X2: $int,X3: $int,X4: $int,X5: $int,X6: $int,X7: $int] :
( ! [X8: $int,X9: $int] : ( $sum($product(X8,X0),$product(X9,X1)) != X7 )
& ~ $less(0,X6)
& ( $sum($product(X3,X0),$product(X2,X1)) = X6 )
& ( $sum($product(X5,X0),$product(X4,X1)) = X7 )
& ( gcd(X0,X1) = gcd(X7,X6) )
& ~ $less(X6,0)
& ~ $less(X7,0) )
& ~ $less(X1,0)
& ~ $less(X0,0) ),
inference(flattening,[],[f159]) ).
tff(f159,plain,
? [X0: $int,X1: $int] :
( ? [X2: $int,X3: $int,X4: $int,X5: $int,X6: $int,X7: $int] :
( ! [X8: $int,X9: $int] : ( $sum($product(X8,X0),$product(X9,X1)) != X7 )
& ~ $less(0,X6)
& ( $sum($product(X3,X0),$product(X2,X1)) = X6 )
& ( $sum($product(X5,X0),$product(X4,X1)) = X7 )
& ( gcd(X0,X1) = gcd(X7,X6) )
& ~ $less(X6,0)
& ~ $less(X7,0) )
& ~ $less(X1,0)
& ~ $less(X0,0) ),
inference(ennf_transformation,[],[f130]) ).
tff(f130,plain,
~ ! [X0: $int,X1: $int] :
( ( ~ $less(X1,0)
& ~ $less(X0,0) )
=> ! [X2: $int,X3: $int,X4: $int,X5: $int,X6: $int,X7: $int] :
( ( ( $sum($product(X3,X0),$product(X2,X1)) = X6 )
& ( $sum($product(X5,X0),$product(X4,X1)) = X7 )
& ( gcd(X0,X1) = gcd(X7,X6) )
& ~ $less(X6,0)
& ~ $less(X7,0) )
=> ( ~ $less(0,X6)
=> ? [X8: $int,X9: $int] : ( $sum($product(X8,X0),$product(X9,X1)) = X7 ) ) ) ),
inference(rectify,[],[f106]) ).
tff(f106,plain,
~ ! [X1: $int,X7: $int] :
( ( ~ $less(X7,0)
& ~ $less(X1,0) )
=> ! [X8: $int,X12: $int,X11: $int,X0: $int,X14: $int,X2: $int] :
( ( ( $sum($product(X12,X1),$product(X8,X7)) = X14 )
& ( $sum($product(X0,X1),$product(X11,X7)) = X2 )
& ( gcd(X1,X7) = gcd(X2,X14) )
& ~ $less(X14,0)
& ~ $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,X7)
& $lesseq(0,X1) )
=> ! [X8: $int,X12: $int,X11: $int,X0: $int,X14: $int,X2: $int] :
( ( ( $sum($product(X12,X1),$product(X8,X7)) = X14 )
& ( $sum($product(X0,X1),$product(X11,X7)) = X2 )
& ( gcd(X1,X7) = gcd(X2,X14) )
& $lesseq(0,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,X7)
& $lesseq(0,X1) )
=> ! [X8: $int,X12: $int,X11: $int,X0: $int,X14: $int,X2: $int] :
( ( ( $sum($product(X12,X1),$product(X8,X7)) = X14 )
& ( $sum($product(X0,X1),$product(X11,X7)) = X2 )
& ( gcd(X1,X7) = gcd(X2,X14) )
& $lesseq(0,X14)
& $lesseq(0,X2) )
=> ( ~ $less(0,X14)
=> ? [X15: $int,X16: $int] : ( $sum($product(X15,X1),$product(X16,X7)) = X2 ) ) ) ),
file('/export/starexec/sandbox2/benchmark/theBenchmark.p',wP_parameter_gcd) ).
tff(f200,plain,
sK7 = $sum($product(sK5,sK0),$product(sK4,sK1)),
inference(cnf_transformation,[],[f188]) ).
%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.00/0.11 % Problem : SWW600_2 : TPTP v8.2.0. Released v6.1.0.
% 0.11/0.13 % 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.13/0.33 % Computer : n032.cluster.edu
% 0.13/0.33 % Model : x86_64 x86_64
% 0.13/0.33 % CPU : Intel(R) Xeon(R) CPU E5-2620 v4 @ 2.10GHz
% 0.13/0.33 % Memory : 8042.1875MB
% 0.13/0.33 % OS : Linux 3.10.0-693.el7.x86_64
% 0.13/0.33 % CPULimit : 300
% 0.13/0.33 % WCLimit : 300
% 0.13/0.33 % DateTime : Sat May 18 20:23:22 EDT 2024
% 0.13/0.33 % CPUTime :
% 0.13/0.33 This is a TF0_THM_EQU_ARI problem
% 0.18/0.33 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.60/0.81 % (22583)lrs+1002_1:16_to=lpo:sil=32000:sp=unary_frequency:sos=on:i=45:bd=off:ss=axioms_0 on theBenchmark for (2995ds/45Mi)
% 0.60/0.81 % (22580)lrs+1011_1:1_sil=8000:sp=occurrence:nwc=10.0:i=78:ss=axioms:sgt=8_0 on theBenchmark for (2995ds/78Mi)
% 0.60/0.81 % (22578)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.60/0.81 % (22581)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.60/0.81 % (22585)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.60/0.81 % (22582)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.60/0.81 % (22584)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 theBenchmark for (2995ds/83Mi)
% 0.60/0.81 % (22579)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 theBenchmark for (2995ds/51Mi)
% 0.60/0.81 % (22583)First to succeed.
% 0.60/0.81 % (22581)Also succeeded, but the first one will report.
% 0.60/0.81 % (22583)Solution written to "/export/starexec/sandbox2/tmp/vampire-proof-22576"
% 0.60/0.82 % (22583)Refutation found. Thanks to Tanya!
% 0.60/0.82 % SZS status Theorem for theBenchmark
% 0.60/0.82 % SZS output start Proof for theBenchmark
% See solution above
% 0.60/0.82 % (22583)------------------------------
% 0.60/0.82 % (22583)Version: Vampire 4.8 (commit 3a798227e on 2024-05-03 07:42:47 +0200)
% 0.60/0.82 % (22583)Termination reason: Refutation
% 0.60/0.82
% 0.60/0.82 % (22583)Memory used [KB]: 1093
% 0.60/0.82 % (22583)Time elapsed: 0.006 s
% 0.60/0.82 % (22583)Instructions burned: 9 (million)
% 0.60/0.82 % (22576)Success in time 0.475 s
% 0.60/0.82 % Vampire---4.8 exiting
%------------------------------------------------------------------------------