TSTP Solution File: SWW632_2 by SnakeForV---1.0
View Problem
- Process Solution
%------------------------------------------------------------------------------
% File : SnakeForV---1.0
% Problem : SWW632_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_uns --cores 0 -t %d %s
% Computer : n011.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:08:57 EDT 2022
% Result : Theorem 0.18s 0.48s
% Output : Refutation 0.18s
% Verified :
% SZS Type : Refutation
% Derivation depth : 16
% Number of leaves : 35
% Syntax : Number of formulae : 67 ( 23 unt; 27 typ; 0 def)
% Number of atoms : 96 ( 51 equ)
% Maximal formula atoms : 10 ( 2 avg)
% Number of connectives : 102 ( 46 ~; 5 |; 34 &)
% ( 0 <=>; 17 =>; 0 <=; 0 <~>)
% Maximal formula depth : 12 ( 4 avg)
% Maximal term depth : 3 ( 1 avg)
% Number arithmetic : 226 ( 44 atm; 38 fun; 70 num; 74 var)
% Number of types : 6 ( 4 usr; 1 ari)
% Number of type conns : 19 ( 10 >; 9 *; 0 +; 0 <<)
% Number of predicates : 5 ( 1 usr; 1 prp; 0-2 aty)
% Number of functors : 26 ( 22 usr; 15 con; 0-4 aty)
% Number of variables : 74 ( 48 !; 26 ?; 74 :)
% 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,
power: ( $int * $int ) > $int ).
tff(func_def_16,type,
abs: $int > $int ).
tff(func_def_18,type,
div: ( $int * $int ) > $int ).
tff(func_def_19,type,
mod: ( $int * $int ) > $int ).
tff(func_def_20,type,
ref: ty > ty ).
tff(func_def_21,type,
mk_ref: ( ty * uni ) > uni ).
tff(func_def_22,type,
contents: ( ty * uni ) > uni ).
tff(func_def_23,type,
sK0: $int ).
tff(func_def_24,type,
sK1: $int ).
tff(func_def_25,type,
sK2: $int ).
tff(func_def_26,type,
sK3: $int ).
tff(func_def_27,type,
sK4: $int ).
tff(pred_def_1,type,
sort: ( ty * uni ) > $o ).
tff(f312,plain,
$false,
inference(subsumption_resolution,[],[f311,f118]) ).
tff(f118,plain,
sK2 != power(sK0,sK1),
inference(cnf_transformation,[],[f106]) ).
tff(f106,plain,
( ~ $less(0,sK4)
& ( sK2 != power(sK0,sK1) )
& ~ $less(sK4,0)
& ( $product(sK2,power(sK3,sK4)) = power(sK0,sK1) )
& ~ $less(sK1,0) ),
inference(skolemisation,[status(esa),new_symbols(skolem,[sK0,sK1,sK2,sK3,sK4])],[f103,f105,f104]) ).
tff(f104,plain,
( ? [X0: $int,X1: $int] :
( ? [X2: $int,X3: $int,X4: $int] :
( ~ $less(0,X4)
& ( power(X0,X1) != X2 )
& ~ $less(X4,0)
& ( $product(X2,power(X3,X4)) = power(X0,X1) ) )
& ~ $less(X1,0) )
=> ( ? [X4: $int,X3: $int,X2: $int] :
( ~ $less(0,X4)
& ( power(sK0,sK1) != X2 )
& ~ $less(X4,0)
& ( $product(X2,power(X3,X4)) = power(sK0,sK1) ) )
& ~ $less(sK1,0) ) ),
introduced(choice_axiom,[]) ).
tff(f105,plain,
( ? [X4: $int,X3: $int,X2: $int] :
( ~ $less(0,X4)
& ( power(sK0,sK1) != X2 )
& ~ $less(X4,0)
& ( $product(X2,power(X3,X4)) = power(sK0,sK1) ) )
=> ( ~ $less(0,sK4)
& ( sK2 != power(sK0,sK1) )
& ~ $less(sK4,0)
& ( $product(sK2,power(sK3,sK4)) = power(sK0,sK1) ) ) ),
introduced(choice_axiom,[]) ).
tff(f103,plain,
? [X0: $int,X1: $int] :
( ? [X2: $int,X3: $int,X4: $int] :
( ~ $less(0,X4)
& ( power(X0,X1) != X2 )
& ~ $less(X4,0)
& ( $product(X2,power(X3,X4)) = power(X0,X1) ) )
& ~ $less(X1,0) ),
inference(rectify,[],[f91]) ).
tff(f91,plain,
? [X1: $int,X0: $int] :
( ? [X4: $int,X2: $int,X3: $int] :
( ~ $less(0,X3)
& ( power(X1,X0) != X4 )
& ~ $less(X3,0)
& ( power(X1,X0) = $product(X4,power(X2,X3)) ) )
& ~ $less(X0,0) ),
inference(flattening,[],[f90]) ).
tff(f90,plain,
? [X0: $int,X1: $int] :
( ? [X4: $int,X2: $int,X3: $int] :
( ( power(X1,X0) != X4 )
& ~ $less(0,X3)
& ~ $less(X3,0)
& ( power(X1,X0) = $product(X4,power(X2,X3)) ) )
& ~ $less(X0,0) ),
inference(ennf_transformation,[],[f77]) ).
tff(f77,plain,
~ ! [X0: $int,X1: $int] :
( ~ $less(X0,0)
=> ! [X4: $int,X2: $int,X3: $int] :
( ( ~ $less(X3,0)
& ( power(X1,X0) = $product(X4,power(X2,X3)) ) )
=> ( ~ $less(0,X3)
=> ( power(X1,X0) = X4 ) ) ) ),
inference(rectify,[],[f48]) ).
tff(f48,plain,
~ ! [X8: $int,X1: $int] :
( ~ $less(X8,0)
=> ! [X11: $int,X10: $int,X12: $int] :
( ( ( power(X1,X8) = $product(X12,power(X11,X10)) )
& ~ $less(X10,0) )
=> ( ~ $less(0,X10)
=> ( power(X1,X8) = X12 ) ) ) ),
inference(theory_normalization,[],[f38]) ).
tff(f38,negated_conjecture,
~ ! [X8: $int,X1: $int] :
( $lesseq(0,X8)
=> ! [X11: $int,X10: $int,X12: $int] :
( ( ( power(X1,X8) = $product(X12,power(X11,X10)) )
& $lesseq(0,X10) )
=> ( ~ $less(0,X10)
=> ( power(X1,X8) = X12 ) ) ) ),
inference(negated_conjecture,[],[f37]) ).
tff(f37,conjecture,
! [X8: $int,X1: $int] :
( $lesseq(0,X8)
=> ! [X11: $int,X10: $int,X12: $int] :
( ( ( power(X1,X8) = $product(X12,power(X11,X10)) )
& $lesseq(0,X10) )
=> ( ~ $less(0,X10)
=> ( power(X1,X8) = X12 ) ) ) ),
file('/export/starexec/sandbox/benchmark/theBenchmark.p',wP_parameter_fast_exp_imperative) ).
tff(f311,plain,
sK2 = power(sK0,sK1),
inference(backward_demodulation,[],[f217,f298]) ).
tff(f298,plain,
! [X1: $int] : ( $product(1,X1) = X1 ),
inference(superposition,[],[f70,f223]) ).
tff(f223,plain,
! [X0: $int] : ( $product(X0,1) = X0 ),
inference(forward_demodulation,[],[f222,f107]) ).
tff(f107,plain,
! [X0: $int] : ( 1 = power(X0,0) ),
inference(cnf_transformation,[],[f81]) ).
tff(f81,plain,
! [X0: $int] : ( 1 = power(X0,0) ),
inference(rectify,[],[f9]) ).
tff(f9,axiom,
! [X1: $int] : ( power(X1,0) = 1 ),
file('/export/starexec/sandbox/benchmark/theBenchmark.p',power_0) ).
tff(f222,plain,
! [X0: $int] : ( $product(X0,power(X0,0)) = X0 ),
inference(forward_demodulation,[],[f202,f112]) ).
tff(f112,plain,
! [X0: $int] : ( power(X0,1) = X0 ),
inference(cnf_transformation,[],[f85]) ).
tff(f85,plain,
! [X0: $int] : ( power(X0,1) = X0 ),
inference(rectify,[],[f12]) ).
tff(f12,axiom,
! [X1: $int] : ( power(X1,1) = X1 ),
file('/export/starexec/sandbox/benchmark/theBenchmark.p',power_1) ).
tff(f202,plain,
! [X0: $int] : ( $product(X0,power(X0,0)) = power(X0,1) ),
inference(evaluation,[],[f189]) ).
tff(f189,plain,
! [X0: $int] : ( $product(X0,power(X0,0)) = power(X0,$sum(0,1)) ),
inference(backward_demodulation,[],[f152,f180]) ).
tff(f180,plain,
0 = sK4,
inference(unit_resulting_resolution,[],[f117,f119,f66]) ).
tff(f66,plain,
! [X0: $int,X1: $int] :
( $less(X1,X0)
| $less(X0,X1)
| ( X0 = X1 ) ),
introduced(theory_axiom_149,[]) ).
tff(f119,plain,
~ $less(0,sK4),
inference(cnf_transformation,[],[f106]) ).
tff(f117,plain,
~ $less(sK4,0),
inference(cnf_transformation,[],[f106]) ).
tff(f152,plain,
! [X0: $int] : ( $product(X0,power(X0,sK4)) = power(X0,$sum(sK4,1)) ),
inference(unit_resulting_resolution,[],[f117,f109]) ).
tff(f109,plain,
! [X0: $int,X1: $int] :
( $less(X0,0)
| ( power(X1,$sum(X0,1)) = $product(X1,power(X1,X0)) ) ),
inference(cnf_transformation,[],[f98]) ).
tff(f98,plain,
! [X0: $int,X1: $int] :
( ( power(X1,$sum(X0,1)) = $product(X1,power(X1,X0)) )
| $less(X0,0) ),
inference(rectify,[],[f92]) ).
tff(f92,plain,
! [X1: $int,X0: $int] :
( ( $product(X0,power(X0,X1)) = power(X0,$sum(X1,1)) )
| $less(X1,0) ),
inference(ennf_transformation,[],[f79]) ).
tff(f79,plain,
! [X1: $int,X0: $int] :
( ~ $less(X1,0)
=> ( $product(X0,power(X0,X1)) = power(X0,$sum(X1,1)) ) ),
inference(rectify,[],[f52]) ).
tff(f52,plain,
! [X1: $int,X8: $int] :
( ~ $less(X8,0)
=> ( power(X1,$sum(X8,1)) = $product(X1,power(X1,X8)) ) ),
inference(theory_normalization,[],[f10]) ).
tff(f10,axiom,
! [X1: $int,X8: $int] :
( $lesseq(0,X8)
=> ( power(X1,$sum(X8,1)) = $product(X1,power(X1,X8)) ) ),
file('/export/starexec/sandbox/benchmark/theBenchmark.p',power_s) ).
tff(f70,plain,
! [X0: $int,X1: $int] : ( $product(X0,X1) = $product(X1,X0) ),
introduced(theory_axiom_140,[]) ).
tff(f217,plain,
$product(1,sK2) = power(sK0,sK1),
inference(forward_demodulation,[],[f216,f70]) ).
tff(f216,plain,
$product(sK2,1) = power(sK0,sK1),
inference(forward_demodulation,[],[f183,f107]) ).
tff(f183,plain,
$product(sK2,power(sK3,0)) = power(sK0,sK1),
inference(backward_demodulation,[],[f116,f180]) ).
tff(f116,plain,
$product(sK2,power(sK3,sK4)) = power(sK0,sK1),
inference(cnf_transformation,[],[f106]) ).
%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.03/0.11 % Problem : SWW632=2 : TPTP v8.1.0. Released v6.1.0.
% 0.03/0.12 % Command : vampire --input_syntax tptp --proof tptp --output_axiom_names on --mode portfolio --schedule snake_tptp_uns --cores 0 -t %d %s
% 0.11/0.33 % Computer : n011.cluster.edu
% 0.11/0.33 % Model : x86_64 x86_64
% 0.11/0.33 % CPU : Intel(R) Xeon(R) CPU E5-2620 v4 @ 2.10GHz
% 0.11/0.33 % Memory : 8042.1875MB
% 0.11/0.33 % OS : Linux 3.10.0-693.el7.x86_64
% 0.11/0.33 % CPULimit : 300
% 0.11/0.33 % WCLimit : 300
% 0.11/0.33 % DateTime : Tue Aug 30 20:54:25 EDT 2022
% 0.11/0.33 % CPUTime :
% 0.18/0.45 % (7126)lrs+22_1:1_amm=sco:fsr=off:gve=force:sos=on:uwa=all:i=50:si=on:rawr=on:rtra=on_0 on theBenchmark for (2999ds/50Mi)
% 0.18/0.45 % (7123)dis+32_1:1_bd=off:nm=4:sos=on:ss=included:i=4:si=on:rawr=on:rtra=on_0 on theBenchmark for (2999ds/4Mi)
% 0.18/0.46 % (7123)Instruction limit reached!
% 0.18/0.46 % (7123)------------------------------
% 0.18/0.46 % (7123)Version: Vampire 4.7 (commit 807e37dd9 on 2022-08-23 09:55:27 +0200)
% 0.18/0.46 % (7123)Linked with Z3 4.8.13.0 f03d756e086f81f2596157241e0decfb1c982299 z3-4.8.4-5390-gf03d756e0
% 0.18/0.46 % (7123)Termination reason: Unknown
% 0.18/0.46 % (7123)Termination phase: Saturation
% 0.18/0.46
% 0.18/0.46 % (7123)Memory used [KB]: 1023
% 0.18/0.46 % (7123)Time elapsed: 0.006 s
% 0.18/0.46 % (7123)Instructions burned: 5 (million)
% 0.18/0.46 % (7123)------------------------------
% 0.18/0.46 % (7123)------------------------------
% 0.18/0.46 % (7118)lrs+10_5:1_br=off:fde=none:nwc=3.0:sd=1:sgt=10:sos=on:ss=axioms:urr=on:i=32:si=on:rawr=on:rtra=on_0 on theBenchmark for (2999ds/32Mi)
% 0.18/0.46 % (7115)ott+21_1:1_erd=off:s2a=on:sac=on:sd=1:sgt=64:sos=on:ss=included:st=3.0:to=lpo:urr=on:i=2:si=on:rawr=on:rtra=on_0 on theBenchmark for (2999ds/2Mi)
% 0.18/0.47 % (7115)Instruction limit reached!
% 0.18/0.47 % (7115)------------------------------
% 0.18/0.47 % (7115)Version: Vampire 4.7 (commit 807e37dd9 on 2022-08-23 09:55:27 +0200)
% 0.18/0.47 % (7115)Linked with Z3 4.8.13.0 f03d756e086f81f2596157241e0decfb1c982299 z3-4.8.4-5390-gf03d756e0
% 0.18/0.47 % (7115)Termination reason: Unknown
% 0.18/0.47 % (7115)Termination phase: Property scanning
% 0.18/0.47
% 0.18/0.47 % (7115)Memory used [KB]: 895
% 0.18/0.47 % (7115)Time elapsed: 0.004 s
% 0.18/0.47 % (7115)Instructions burned: 2 (million)
% 0.18/0.47 % (7115)------------------------------
% 0.18/0.47 % (7115)------------------------------
% 0.18/0.48 % (7118)First to succeed.
% 0.18/0.48 % (7118)Refutation found. Thanks to Tanya!
% 0.18/0.48 % SZS status Theorem for theBenchmark
% 0.18/0.48 % SZS output start Proof for theBenchmark
% See solution above
% 0.18/0.48 % (7118)------------------------------
% 0.18/0.48 % (7118)Version: Vampire 4.7 (commit 807e37dd9 on 2022-08-23 09:55:27 +0200)
% 0.18/0.48 % (7118)Linked with Z3 4.8.13.0 f03d756e086f81f2596157241e0decfb1c982299 z3-4.8.4-5390-gf03d756e0
% 0.18/0.48 % (7118)Termination reason: Refutation
% 0.18/0.48
% 0.18/0.48 % (7118)Memory used [KB]: 5628
% 0.18/0.48 % (7118)Time elapsed: 0.105 s
% 0.18/0.48 % (7118)Instructions burned: 10 (million)
% 0.18/0.48 % (7118)------------------------------
% 0.18/0.48 % (7118)------------------------------
% 0.18/0.48 % (7111)Success in time 0.143 s
%------------------------------------------------------------------------------