TSTP Solution File: SWW632_2 by Vampire---4.8
View Problem
- Process Solution
%------------------------------------------------------------------------------
% File : Vampire---4.8
% Problem : SWW632_2 : TPTP v8.1.2. Released v6.1.0.
% Transfm : none
% Format : tptp:raw
% Command : vampire --ignore_missing on --mode portfolio/casc [--schedule casc_hol_2020] -p tptp -om szs -t %d %s
% Computer : n009.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 : Fri Sep 1 01:05:23 EDT 2023
% Result : Theorem 0.22s 0.44s
% Output : Refutation 0.22s
% Verified :
% SZS Type : Refutation
% Derivation depth : 15
% Number of leaves : 38
% Syntax : Number of formulae : 60 ( 19 unt; 30 typ; 0 def)
% Number of atoms : 77 ( 40 equ)
% Maximal formula atoms : 10 ( 2 avg)
% Number of connectives : 88 ( 41 ~; 3 |; 30 &)
% ( 0 <=>; 14 =>; 0 <=; 0 <~>)
% Maximal formula depth : 12 ( 4 avg)
% Maximal term depth : 3 ( 1 avg)
% Number arithmetic : 141 ( 36 atm; 14 fun; 45 num; 46 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 : 28 ( 25 usr; 18 con; 0-4 aty)
% Number of variables : 46 (; 25 !; 21 ?; 46 :)
% 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(func_def_28,type,
sF5: $int ).
tff(func_def_29,type,
sF6: $int ).
tff(func_def_30,type,
sF7: $int ).
tff(pred_def_1,type,
sort: ( ty * uni ) > $o ).
tff(f367,plain,
$false,
inference(subsumption_resolution,[],[f366,f199]) ).
tff(f199,plain,
sK4 != sF5,
inference(definition_folding,[],[f155,f198]) ).
tff(f198,plain,
power(sK0,sK1) = sF5,
introduced(function_definition,[]) ).
tff(f155,plain,
power(sK0,sK1) != sK4,
inference(cnf_transformation,[],[f148]) ).
tff(f148,plain,
( ( power(sK0,sK1) != sK4 )
& ~ $less(0,sK2)
& ( power(sK0,sK1) = $product(sK4,power(sK3,sK2)) )
& ~ $less(sK2,0)
& ~ $less(sK1,0) ),
inference(skolemisation,[status(esa),new_symbols(skolem,[sK0,sK1,sK2,sK3,sK4])],[f110,f147,f146]) ).
tff(f146,plain,
( ? [X0: $int,X1: $int] :
( ? [X2: $int,X3: $int,X4: $int] :
( ( power(X0,X1) != X4 )
& ~ $less(0,X2)
& ( power(X0,X1) = $product(X4,power(X3,X2)) )
& ~ $less(X2,0) )
& ~ $less(X1,0) )
=> ( ? [X4: $int,X3: $int,X2: $int] :
( ( power(sK0,sK1) != X4 )
& ~ $less(0,X2)
& ( $product(X4,power(X3,X2)) = power(sK0,sK1) )
& ~ $less(X2,0) )
& ~ $less(sK1,0) ) ),
introduced(choice_axiom,[]) ).
tff(f147,plain,
( ? [X4: $int,X3: $int,X2: $int] :
( ( power(sK0,sK1) != X4 )
& ~ $less(0,X2)
& ( $product(X4,power(X3,X2)) = power(sK0,sK1) )
& ~ $less(X2,0) )
=> ( ( power(sK0,sK1) != sK4 )
& ~ $less(0,sK2)
& ( power(sK0,sK1) = $product(sK4,power(sK3,sK2)) )
& ~ $less(sK2,0) ) ),
introduced(choice_axiom,[]) ).
tff(f110,plain,
? [X0: $int,X1: $int] :
( ? [X2: $int,X3: $int,X4: $int] :
( ( power(X0,X1) != X4 )
& ~ $less(0,X2)
& ( power(X0,X1) = $product(X4,power(X3,X2)) )
& ~ $less(X2,0) )
& ~ $less(X1,0) ),
inference(flattening,[],[f109]) ).
tff(f109,plain,
? [X0: $int,X1: $int] :
( ? [X2: $int,X3: $int,X4: $int] :
( ( power(X0,X1) != X4 )
& ~ $less(0,X2)
& ( power(X0,X1) = $product(X4,power(X3,X2)) )
& ~ $less(X2,0) )
& ~ $less(X1,0) ),
inference(ennf_transformation,[],[f77]) ).
tff(f77,plain,
~ ! [X0: $int,X1: $int] :
( ~ $less(X1,0)
=> ! [X2: $int,X3: $int,X4: $int] :
( ( ( power(X0,X1) = $product(X4,power(X3,X2)) )
& ~ $less(X2,0) )
=> ( ~ $less(0,X2)
=> ( power(X0,X1) = X4 ) ) ) ),
inference(rectify,[],[f39]) ).
tff(f39,plain,
~ ! [X1: $int,X8: $int] :
( ~ $less(X8,0)
=> ! [X10: $int,X11: $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,
~ ! [X1: $int,X8: $int] :
( $lesseq(0,X8)
=> ! [X10: $int,X11: $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,
! [X1: $int,X8: $int] :
( $lesseq(0,X8)
=> ! [X10: $int,X11: $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/tmp/tmp.LxQpFnu3Qy/Vampire---4.8_5907',wP_parameter_fast_exp_imperative) ).
tff(f366,plain,
sK4 = sF5,
inference(forward_demodulation,[],[f365,f202]) ).
tff(f202,plain,
sF5 = sF7,
inference(definition_folding,[],[f153,f201,f200,f198]) ).
tff(f200,plain,
power(sK3,sK2) = sF6,
introduced(function_definition,[]) ).
tff(f201,plain,
$product(sK4,sF6) = sF7,
introduced(function_definition,[]) ).
tff(f153,plain,
power(sK0,sK1) = $product(sK4,power(sK3,sK2)),
inference(cnf_transformation,[],[f148]) ).
tff(f365,plain,
sK4 = sF7,
inference(evaluation,[],[f359]) ).
tff(f359,plain,
sF7 = $product(sK4,1),
inference(superposition,[],[f201,f358]) ).
tff(f358,plain,
1 = sF6,
inference(forward_demodulation,[],[f357,f163]) ).
tff(f163,plain,
! [X0: $int] : ( 1 = power(X0,0) ),
inference(cnf_transformation,[],[f83]) ).
tff(f83,plain,
! [X0: $int] : ( 1 = power(X0,0) ),
inference(rectify,[],[f9]) ).
tff(f9,axiom,
! [X1: $int] : ( power(X1,0) = 1 ),
file('/export/starexec/sandbox/tmp/tmp.LxQpFnu3Qy/Vampire---4.8_5907',power_0) ).
tff(f357,plain,
sF6 = power(sK3,0),
inference(superposition,[],[f200,f227]) ).
tff(f227,plain,
0 = sK2,
inference(subsumption_resolution,[],[f223,f154]) ).
tff(f154,plain,
~ $less(0,sK2),
inference(cnf_transformation,[],[f148]) ).
tff(f223,plain,
( $less(0,sK2)
| ( 0 = sK2 ) ),
inference(resolution,[],[f152,f66]) ).
tff(f66,plain,
! [X0: $int,X1: $int] :
( $less(X0,X1)
| $less(X1,X0)
| ( X0 = X1 ) ),
introduced(theory_axiom_147,[]) ).
tff(f152,plain,
~ $less(sK2,0),
inference(cnf_transformation,[],[f148]) ).
%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.11/0.13 % Problem : SWW632_2 : TPTP v8.1.2. Released v6.1.0.
% 0.11/0.15 % Command : vampire --ignore_missing on --mode portfolio/casc [--schedule casc_hol_2020] -p tptp -om szs -t %d %s
% 0.15/0.36 % Computer : n009.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 Aug 27 20:16:05 EDT 2023
% 0.15/0.36 % CPUTime :
% 0.15/0.36 This is a TF0_THM_EQU_ARI problem
% 0.15/0.36 Running vampire_casc2023 --mode casc -m 16384 --cores 7 -t 300 /export/starexec/sandbox/tmp/tmp.LxQpFnu3Qy/Vampire---4.8_5907
% 0.15/0.37 % (6155)Running in auto input_syntax mode. Trying TPTP
% 0.22/0.43 % (6158)dis-10_20_canc=force:fsd=off:gs=on:gsem=off:nm=0:sas=z3:sac=on:tha=off:thi=strong:tgt=ground_476 on Vampire---4 for (476ds/0Mi)
% 0.22/0.43 % (6157)dis-1010_2:3_canc=force:fsd=off:fde=unused:gs=on:gsem=on:nm=0:nwc=1.3:sas=z3:tha=off:thf=on:uwa=ground_572 on Vampire---4 for (572ds/0Mi)
% 0.22/0.43 % (6160)lrs+1010_2:1_amm=off:bs=on:bsr=on:canc=force:fsd=off:fsr=off:gs=on:gsaa=full_model:gsem=on:nm=0:nwc=1.3:sas=z3:sac=on:tha=off:thi=overlap:tgt=ground:uwa=ground:stl=60_408 on Vampire---4 for (408ds/0Mi)
% 0.22/0.43 % (6161)ott+10_1024_av=off:bd=preordered:br=off:ep=RSTC:fsr=off:fde=none:nm=2:urr=on_318 on Vampire---4 for (318ds/0Mi)
% 0.22/0.43 % (6159)dis-11_10:1_canc=force:fsd=off:nwc=1.5:sas=z3:tha=off:uwa=all_472 on Vampire---4 for (472ds/0Mi)
% 0.22/0.43 % (6156)lrs+2_32_add=large:amm=off:bd=off:bs=unit_only:drc=off:flr=on:fsd=off:fde=none:nm=0:nwc=1.1:sos=theory:sp=reverse_arity:tgt=ground:stl=180_1034 on Vampire---4 for (1034ds/0Mi)
% 0.22/0.43 % (6162)lrs-1010_3_av=off:br=off:drc=off:er=known:fsd=off:fde=unused:nm=4:nwc=3.0:sp=scramble:urr=on:stl=180_280 on Vampire---4 for (280ds/0Mi)
% 0.22/0.44 % (6156)First to succeed.
% 0.22/0.44 % (6162)Also succeeded, but the first one will report.
% 0.22/0.44 % (6156)Refutation found. Thanks to Tanya!
% 0.22/0.44 % SZS status Theorem for Vampire---4
% 0.22/0.44 % SZS output start Proof for Vampire---4
% See solution above
% 0.22/0.44 % (6156)------------------------------
% 0.22/0.44 % (6156)Version: Vampire 4.7 (commit 05ef610bd on 2023-06-21 19:03:17 +0100)
% 0.22/0.44 % (6156)Linked with Z3 4.9.1.0 6ed071b44407cf6623b8d3c0dceb2a8fb7040cee z3-4.8.4-6427-g6ed071b44
% 0.22/0.44 % (6156)Termination reason: Refutation
% 0.22/0.44
% 0.22/0.44 % (6156)Memory used [KB]: 5756
% 0.22/0.44 % (6156)Time elapsed: 0.011 s
% 0.22/0.44 % (6156)------------------------------
% 0.22/0.44 % (6156)------------------------------
% 0.22/0.44 % (6155)Success in time 0.071 s
% 0.22/0.44 % Vampire---4.8 exiting
%------------------------------------------------------------------------------