TSTP Solution File: SWV633_5 by Vampire---4.8
View Problem
- Process Solution
%------------------------------------------------------------------------------
% File : Vampire---4.8
% Problem : SWV633_5 : TPTP v8.1.2. Released v6.0.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/sandbox/solver/bin/quickGreedyProduceRating_steal_pow3.txt --cores 8 -m 12000 -t %d %s
% Computer : n027.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 : Sun May 5 10:38:53 EDT 2024
% Result : Theorem 0.58s 0.76s
% Output : Refutation 0.58s
% Verified :
% SZS Type : Refutation
% Derivation depth : 7
% Number of leaves : 43
% Syntax : Number of formulae : 56 ( 12 unt; 39 typ; 0 def)
% Number of atoms : 22 ( 13 equ)
% Maximal formula atoms : 2 ( 1 avg)
% Number of connectives : 14 ( 9 ~; 3 |; 0 &)
% ( 0 <=>; 2 =>; 0 <=; 0 <~>)
% Maximal formula depth : 7 ( 3 avg)
% Maximal term depth : 7 ( 2 avg)
% Number of FOOLs : 1 ( 1 fml; 0 var)
% Number of types : 6 ( 5 usr)
% Number of type conns : 17 ( 12 >; 5 *; 0 +; 0 <<)
% Number of predicates : 18 ( 16 usr; 1 prp; 0-2 aty)
% Number of functors : 18 ( 18 usr; 7 con; 0-4 aty)
% Number of variables : 41 ( 19 !; 0 ?; 41 :)
% ( 22 !>; 0 ?*; 0 @-; 0 @+)
% Comments :
%------------------------------------------------------------------------------
tff(type_def_5,type,
complex: $tType ).
tff(type_def_6,type,
bool: $tType ).
tff(type_def_7,type,
int: $tType ).
tff(type_def_8,type,
nat: $tType ).
tff(type_def_9,type,
real: $tType ).
tff(type_def_10,type,
fun: ( $tType * $tType ) > $tType ).
tff(func_def_0,type,
ii: complex ).
tff(func_def_1,type,
fFT_Mirabelle_root: nat > complex ).
tff(func_def_2,type,
plus_plus:
!>[X0: $tType] : ( ( X0 * X0 ) > X0 ) ).
tff(func_def_3,type,
times_times:
!>[X0: $tType] : ( ( X0 * X0 ) > X0 ) ).
tff(func_def_4,type,
uminus_uminus:
!>[X0: $tType] : ( X0 > X0 ) ).
tff(func_def_5,type,
bit0: int > int ).
tff(func_def_6,type,
bit1: int > int ).
tff(func_def_7,type,
pls: int ).
tff(func_def_8,type,
number_number_of:
!>[X0: $tType] : ( int > X0 ) ).
tff(func_def_9,type,
suc: nat > nat ).
tff(func_def_10,type,
power_power:
!>[X0: $tType] : ( ( X0 * nat ) > X0 ) ).
tff(func_def_11,type,
aa:
!>[X0: $tType,X1: $tType] : ( ( fun(X0,X1) * X0 ) > X1 ) ).
tff(func_def_12,type,
fFalse: bool ).
tff(func_def_13,type,
fTrue: bool ).
tff(func_def_14,type,
i: nat ).
tff(func_def_15,type,
j: nat ).
tff(func_def_16,type,
m: nat ).
tff(pred_def_1,type,
number:
!>[X0: $tType] : $o ).
tff(pred_def_2,type,
idom:
!>[X0: $tType] : $o ).
tff(pred_def_3,type,
power:
!>[X0: $tType] : $o ).
tff(pred_def_4,type,
ring_1:
!>[X0: $tType] : $o ).
tff(pred_def_5,type,
uminus:
!>[X0: $tType] : $o ).
tff(pred_def_6,type,
semiring:
!>[X0: $tType] : $o ).
tff(pred_def_7,type,
number_ring:
!>[X0: $tType] : $o ).
tff(pred_def_8,type,
ring_char_0:
!>[X0: $tType] : $o ).
tff(pred_def_9,type,
monoid_mult:
!>[X0: $tType] : $o ).
tff(pred_def_10,type,
number_semiring:
!>[X0: $tType] : $o ).
tff(pred_def_11,type,
comm_semiring_1:
!>[X0: $tType] : $o ).
tff(pred_def_12,type,
comm_monoid_mult:
!>[X0: $tType] : $o ).
tff(pred_def_13,type,
boolean_algebra:
!>[X0: $tType] : $o ).
tff(pred_def_14,type,
ab_sem1668676832m_mult:
!>[X0: $tType] : $o ).
tff(pred_def_15,type,
semiri456707255roduct:
!>[X0: $tType] : $o ).
tff(pred_def_16,type,
pp: bool > $o ).
tff(f354,plain,
$false,
inference(subsumption_resolution,[],[f342,f291]) ).
tff(f291,plain,
comm_semiring_1(nat),
inference(cnf_transformation,[],[f115]) ).
tff(f115,axiom,
comm_semiring_1(nat),
file('/export/starexec/sandbox/tmp/tmp.qhtL8QPgFi/Vampire---4.8_27020',arity_Nat_Onat___Rings_Ocomm__semiring__1) ).
tff(f342,plain,
~ comm_semiring_1(nat),
inference(trivial_inequality_removal,[],[f336]) ).
tff(f336,plain,
( ( power_power(complex,fFT_Mirabelle_root(times_times(nat,number_number_of(nat,plus_plus(int,bit1(pls),bit1(pls))),m)),times_times(nat,i,times_times(nat,number_number_of(nat,plus_plus(int,bit1(pls),bit1(pls))),j))) != power_power(complex,fFT_Mirabelle_root(times_times(nat,number_number_of(nat,plus_plus(int,bit1(pls),bit1(pls))),m)),times_times(nat,i,times_times(nat,number_number_of(nat,plus_plus(int,bit1(pls),bit1(pls))),j))) )
| ~ comm_semiring_1(nat) ),
inference(superposition,[],[f310,f303]) ).
tff(f303,plain,
! [X0: $tType,X2: X0,X3: X0,X1: X0] :
( ( times_times(X0,X3,times_times(X0,X2,X1)) = times_times(X0,X2,times_times(X0,X3,X1)) )
| ~ comm_semiring_1(X0) ),
inference(cnf_transformation,[],[f234]) ).
tff(f234,plain,
! [X0: $tType] :
( ! [X1: X0,X2: X0,X3: X0] : ( times_times(X0,X3,times_times(X0,X2,X1)) = times_times(X0,X2,times_times(X0,X3,X1)) )
| ~ comm_semiring_1(X0) ),
inference(ennf_transformation,[],[f201]) ).
tff(f201,plain,
! [X0: $tType] :
( comm_semiring_1(X0)
=> ! [X1: X0,X2: X0,X3: X0] : ( times_times(X0,X3,times_times(X0,X2,X1)) = times_times(X0,X2,times_times(X0,X3,X1)) ) ),
inference(rectify,[],[f27]) ).
tff(f27,axiom,
! [X0: $tType] :
( comm_semiring_1(X0)
=> ! [X15: X0,X16: X0,X18: X0] : ( times_times(X0,X18,times_times(X0,X16,X15)) = times_times(X0,X16,times_times(X0,X18,X15)) ) ),
file('/export/starexec/sandbox/tmp/tmp.qhtL8QPgFi/Vampire---4.8_27020',fact_26_comm__semiring__1__class_Onormalizing__semiring__rules_I19_J) ).
tff(f310,plain,
power_power(complex,fFT_Mirabelle_root(times_times(nat,number_number_of(nat,plus_plus(int,bit1(pls),bit1(pls))),m)),times_times(nat,i,times_times(nat,number_number_of(nat,plus_plus(int,bit1(pls),bit1(pls))),j))) != power_power(complex,fFT_Mirabelle_root(times_times(nat,number_number_of(nat,plus_plus(int,bit1(pls),bit1(pls))),m)),times_times(nat,number_number_of(nat,plus_plus(int,bit1(pls),bit1(pls))),times_times(nat,i,j))),
inference(definition_unfolding,[],[f245,f246,f246,f246,f246]) ).
tff(f246,plain,
! [X0: int] : ( bit0(X0) = plus_plus(int,X0,X0) ),
inference(cnf_transformation,[],[f154]) ).
tff(f154,plain,
! [X0: int] : ( bit0(X0) = plus_plus(int,X0,X0) ),
inference(rectify,[],[f84]) ).
tff(f84,axiom,
! [X9: int] : ( bit0(X9) = plus_plus(int,X9,X9) ),
file('/export/starexec/sandbox/tmp/tmp.qhtL8QPgFi/Vampire---4.8_27020',fact_83_Bit0__def) ).
tff(f245,plain,
power_power(complex,fFT_Mirabelle_root(times_times(nat,number_number_of(nat,bit0(bit1(pls))),m)),times_times(nat,i,times_times(nat,number_number_of(nat,bit0(bit1(pls))),j))) != power_power(complex,fFT_Mirabelle_root(times_times(nat,number_number_of(nat,bit0(bit1(pls))),m)),times_times(nat,number_number_of(nat,bit0(bit1(pls))),times_times(nat,i,j))),
inference(cnf_transformation,[],[f153]) ).
tff(f153,plain,
power_power(complex,fFT_Mirabelle_root(times_times(nat,number_number_of(nat,bit0(bit1(pls))),m)),times_times(nat,i,times_times(nat,number_number_of(nat,bit0(bit1(pls))),j))) != power_power(complex,fFT_Mirabelle_root(times_times(nat,number_number_of(nat,bit0(bit1(pls))),m)),times_times(nat,number_number_of(nat,bit0(bit1(pls))),times_times(nat,i,j))),
inference(flattening,[],[f152]) ).
tff(f152,negated_conjecture,
( ~ power_power(complex,fFT_Mirabelle_root(times_times(nat,number_number_of(nat,bit0(bit1(pls))),m)),times_times(nat,i,times_times(nat,number_number_of(nat,bit0(bit1(pls))),j))) = power_power(complex,fFT_Mirabelle_root(times_times(nat,number_number_of(nat,bit0(bit1(pls))),m)),times_times(nat,number_number_of(nat,bit0(bit1(pls))),times_times(nat,i,j))) ),
inference(negated_conjecture,[],[f151]) ).
tff(f151,conjecture,
power_power(complex,fFT_Mirabelle_root(times_times(nat,number_number_of(nat,bit0(bit1(pls))),m)),times_times(nat,i,times_times(nat,number_number_of(nat,bit0(bit1(pls))),j))) = power_power(complex,fFT_Mirabelle_root(times_times(nat,number_number_of(nat,bit0(bit1(pls))),m)),times_times(nat,number_number_of(nat,bit0(bit1(pls))),times_times(nat,i,j))),
file('/export/starexec/sandbox/tmp/tmp.qhtL8QPgFi/Vampire---4.8_27020',conj_0) ).
%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.12/0.13 % Problem : SWV633_5 : TPTP v8.1.2. Released v6.0.0.
% 0.12/0.15 % Command : vampire --input_syntax tptp --proof tptp --output_axiom_names on --mode portfolio --schedule file --schedule_file /export/starexec/sandbox/solver/bin/quickGreedyProduceRating_steal_pow3.txt --cores 8 -m 12000 -t %d %s
% 0.15/0.36 % Computer : n027.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 : Fri May 3 21:14:53 EDT 2024
% 0.15/0.36 % CPUTime :
% 0.15/0.36 This is a TF1_THM_EQU_NAR problem
% 0.15/0.37 Running vampire --input_syntax tptp --proof tptp --output_axiom_names on --mode portfolio --schedule file --schedule_file /export/starexec/sandbox/solver/bin/quickGreedyProduceRating_steal_pow3.txt --cores 8 -m 12000 -t 300 /export/starexec/sandbox/tmp/tmp.qhtL8QPgFi/Vampire---4.8_27020
% 0.58/0.75 % (27288)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 Vampire---4 for (2996ds/34Mi)
% 0.58/0.75 % (27290)lrs+1011_1:1_sil=8000:sp=occurrence:nwc=10.0:i=78:ss=axioms:sgt=8_0 on Vampire---4 for (2996ds/78Mi)
% 0.58/0.75 % (27291)ott+1011_1:1_sil=2000:urr=on:i=33:sd=1:kws=inv_frequency:ss=axioms:sup=off_0 on Vampire---4 for (2996ds/33Mi)
% 0.58/0.75 % (27292)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 Vampire---4 for (2996ds/34Mi)
% 0.58/0.75 % (27293)lrs+1002_1:16_to=lpo:sil=32000:sp=unary_frequency:sos=on:i=45:bd=off:ss=axioms_0 on Vampire---4 for (2996ds/45Mi)
% 0.58/0.75 % (27289)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 Vampire---4 for (2996ds/51Mi)
% 0.58/0.75 % (27294)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 Vampire---4 for (2996ds/83Mi)
% 0.58/0.75 % (27295)lrs-21_1:1_to=lpo:sil=2000:sp=frequency:sos=on:lma=on:i=56:sd=2:ss=axioms:ep=R_0 on Vampire---4 for (2996ds/56Mi)
% 0.58/0.75 % (27294)WARNING: Not using newCnf currently not compatible with polymorphic/higher-order inputs.
% 0.58/0.76 % (27295)Refutation not found, incomplete strategy% (27295)------------------------------
% 0.58/0.76 % (27295)Version: Vampire 4.8 (commit 3a798227e on 2024-05-03 07:42:47 +0200)
% 0.58/0.76 % (27288)Refutation not found, incomplete strategy% (27288)------------------------------
% 0.58/0.76 % (27288)Version: Vampire 4.8 (commit 3a798227e on 2024-05-03 07:42:47 +0200)
% 0.58/0.76 % (27288)Termination reason: Refutation not found, incomplete strategy
% 0.58/0.76
% 0.58/0.76 % (27288)Memory used [KB]: 1248
% 0.58/0.76 % (27288)Time elapsed: 0.005 s
% 0.58/0.76 % (27288)Instructions burned: 12 (million)
% 0.58/0.76 % (27295)Termination reason: Refutation not found, incomplete strategy
% 0.58/0.76
% 0.58/0.76 % (27295)Memory used [KB]: 1104
% 0.58/0.76 % (27295)Time elapsed: 0.005 s
% 0.58/0.76 % (27295)Instructions burned: 7 (million)
% 0.58/0.76 % (27294)WARNING: Not using GeneralSplitting currently not compatible with polymorphic/higher-order inputs.
% 0.58/0.76 % (27288)------------------------------
% 0.58/0.76 % (27288)------------------------------
% 0.58/0.76 % (27295)------------------------------
% 0.58/0.76 % (27295)------------------------------
% 0.58/0.76 % (27293)First to succeed.
% 0.58/0.76 % (27293)Solution written to "/export/starexec/sandbox/tmp/vampire-proof-27278"
% 0.58/0.76 % (27292)Refutation not found, incomplete strategy% (27292)------------------------------
% 0.58/0.76 % (27292)Version: Vampire 4.8 (commit 3a798227e on 2024-05-03 07:42:47 +0200)
% 0.58/0.76 % (27294)Refutation not found, incomplete strategy% (27294)------------------------------
% 0.58/0.76 % (27294)Version: Vampire 4.8 (commit 3a798227e on 2024-05-03 07:42:47 +0200)
% 0.58/0.76 % (27294)Termination reason: Refutation not found, incomplete strategy
% 0.58/0.76
% 0.58/0.76 % (27294)Memory used [KB]: 1222
% 0.58/0.76 % (27294)Time elapsed: 0.007 s
% 0.58/0.76 % (27294)Instructions burned: 12 (million)
% 0.58/0.76 % (27293)Refutation found. Thanks to Tanya!
% 0.58/0.76 % SZS status Theorem for Vampire---4
% 0.58/0.76 % SZS output start Proof for Vampire---4
% See solution above
% 0.58/0.76 % (27293)------------------------------
% 0.58/0.76 % (27293)Version: Vampire 4.8 (commit 3a798227e on 2024-05-03 07:42:47 +0200)
% 0.58/0.76 % (27293)Termination reason: Refutation
% 0.58/0.76
% 0.58/0.76 % (27293)Memory used [KB]: 1162
% 0.58/0.76 % (27293)Time elapsed: 0.007 s
% 0.58/0.76 % (27293)Instructions burned: 9 (million)
% 0.58/0.76 % (27278)Success in time 0.387 s
% 0.58/0.76 % Vampire---4.8 exiting
%------------------------------------------------------------------------------